A072210 a(1)=a(2)=1; a(n)=reverse(reverse(a(n-1))+reverse(a(n-2))) for n > 2.
1, 1, 2, 3, 5, 8, 31, 12, 43, 55, 98, 441, 332, 773, 16, 834, 994, 739, 6341, 3732, 9083, 2816, 1999, 37161, 46162, 73324, 10586, 838011, 933971, 771092, 615964, 396957, 9029221, 2098891, 1118123, 3107025, 4215248, 73123631, 16275022, 89398653, 95664775
Offset: 1
Examples
a(9)=reverse(reverse(a(8))+reverse(a(7)))=reverse(21+13)=43.
Links
- Vincenzo Librandi, Table of n, a(n) for n = 1..1000
- The Fibonacci Mirror Sequence
Programs
-
Mathematica
rev[n_] := FromDigits[Reverse[IntegerDigits[n]]]; r = {1, 1}; For[i = 1, i < 30, i++, l = Length[r]; r = Append[r, rev[rev[r[[l]]] + rev[r[[l - 1]]]]]]; r rev[n_]:=FromDigits[Reverse[IntegerDigits[n]]]; nxt[{a_,b_}]:={b,rev[ rev[ a]+ rev[b]]}; Transpose[NestList[nxt,{1,1},50]][[1]] (* Harvey P. Dale, Apr 25 2014 *)
Extensions
More terms from Harvey P. Dale, Apr 25 2014
Comments