This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A014258 #29 Nov 03 2023 20:22:06 %S A014258 0,1,1,2,3,5,8,31,93,421,415,638,3501,9314,51821,53116,739401,715297, %T A014258 8964541,8389769,1345371,415379,570671,50689,63126,518311,734185, %U A014258 6942521,6076767,88291031,89776349,83760871,22735371,242694601,279924562,361916225,787048146 %N A014258 Iccanobif numbers: add previous two terms and reverse the sum. %H A014258 Alois P. Heinz, <a href="/A014258/b014258.txt">Table of n, a(n) for n = 0..1000</a> (first 200 terms from N. J. A. Sloane) %H A014258 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>. %p A014258 with(transforms); f:=proc(n) option remember; if n <= 1 then n else digrev(f(n-1)+f(n-2)); fi; end; [seq(f(n),n=0..50)]; %t A014258 Clear[ BiF ]; BiF[ 0 ]=0; BiF[ 1 ]=1; BiF[ n_Integer ] := BiF[ n ]=Plus@@(IntegerDigits[ BiF[ n-2 ]+BiF[ n-1 ], 10 ]//(#*Array[ 10^#&, Length[ # ], 0 ])&); Array[ BiF, 40, 0 ] %t A014258 nxt[{a_,b_}]:={b,FromDigits[Reverse[IntegerDigits[a+b]]]}; Transpose[ NestList[ nxt,{0,1},40]][[1]] (* _Harvey P. Dale_, Jun 15 2013 *) %o A014258 (Python) %o A014258 from itertools import islice %o A014258 def A014258_gen(): # generator of terms %o A014258 a, b = 0, 1 %o A014258 yield 0 %o A014258 while True: %o A014258 yield b %o A014258 a, b = b, int(str(a+b)[::-1]) %o A014258 A014358_list = list(islice(A014258_gen(),20)) # _Chai Wah Wu_, Jan 15 2022 %Y A014258 Cf. A000045, A001129, A014259, A014260. %K A014258 nonn,base,easy %O A014258 0,4 %A A014258 _N. J. A. Sloane_