Iccanobirt numbers (1 of 15): a(n) = a(n-1) + a(n-2) + R(a(n-3)), where R is the digit reversal function A004086.

A102111

Iccanobirt numbers (1 of 15): a(n) = a(n-1) + a(n-2) + R(a(n-3)), where R is the digit reversal function A004086.

Terms

    a(0) =0a(1) =0a(2) =1a(3) =1a(4) =2a(5) =4a(6) =7a(7) =13a(8) =24a(9) =44a(10) =99a(11) =185a(12) =328a(13) =612a(14) =1521a(15) =2956a(16) =4693a(17) =8900a(18) =20185a(19) =33049a(20) =53332a(21) =144483a(22) =291848a(23) =459666a(24) =1135955a(25) =2443813a(26) =4246722a(27) =12285846a(28) =19716010a(29) =34278280

External references