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.
a001129 n = a001129_list !! n a001129_list = 0 : 1 : zipWith (+) iccanobifs (tail iccanobifs) where iccanobifs = map a004086 a001129_list -- Reinhard Zumkeller, Jan 01 2012
a:=[0,1];[n le 2 select a[n] else Seqint(Reverse(Intseq(Self(n-1)))) + Seqint(Reverse(Intseq(Self(n-2)))):n in [1..35]]; // Marius A. Burtea, Oct 23 2019
R:= n-> (s-> parse(cat(s[-i]$i=1..length(s))))(""||n):
a:= proc(n) option remember; `if`(n<2, n,
R(a(n-1)) +R(a(n-2)))
end:
seq(a(n), n=0..50); # Alois P. Heinz, Jun 18 2014
Clear[ BIF ]; BIF[ 0 ]=0; BIF[ 1 ]=1; BIF[ n_Integer ] := BIF[ n ]=Plus@@Map[ Plus@@(#*Array[ 10^#&, Length[ # ], 0 ])&, Map[ IntegerDigits, {BIF[ n-1 ], BIF[ n-2 ]} ] ]; Array[ BIF, 40, 0 ]
nxt[{a_,b_}]:={b,Total[FromDigits/@Reverse/@IntegerDigits[ {a,b}]]}; Transpose[NestList[nxt,{0,1},40]][[1]] (* Harvey P. Dale, Jun 22 2011 *)
nxt[{a_,b_}]:={b,Total[IntegerReverse[{a,b}]]}; NestList[nxt,{0,1},40][[All,1]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Aug 07 2019 *)
A001129(n,a=0,b=1)={ n || return; while( n-->0, b=A004086(a)+A004086(a=b)); b }
A001129_list, r1, r2 = [0,1], 1, 0 for _ in range(10**2): l, r2 = r1+r2, r1 r1 = int(str(l)[::-1]) A001129_list.append(l) # Chai Wah Wu, Jan 03 2015
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)];
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 ]
nxt[{a_,b_}]:={b,FromDigits[Reverse[IntegerDigits[a+b]]]}; Transpose[ NestList[ nxt,{0,1},40]][[1]] (* Harvey P. Dale, Jun 15 2013 *)
from itertools import islice def A014258_gen(): # generator of terms a, b = 0, 1 yield 0 while True: yield b a, b = b, int(str(a+b)[::-1]) A014358_list = list(islice(A014258_gen(),20)) # Chai Wah Wu, Jan 15 2022
R:= n-> (s-> parse(cat(s[-i]$i=1..length(s))))(""||n):
a:= proc(n) option remember; `if`(n<2, n,
a(n-1) +R(a(n-2)))
end:
seq(a(n), n=0..50); # Alois P. Heinz, Jun 18 2014
Clear[ Bif ]; Bif[ 0 ]=0; Bif[ 1 ]=1; Bif[ n_Integer ] := Bif[ n ]=Bif[ n-1 ]+Plus@@(IntegerDigits[ Bif[ n-2 ], 10 ]//(#*Array[ 10^#&, Length[ # ], 0 ])&); Array[ Bif, 40, 0 ]
nxt[{a_,b_}]:={b,IntegerReverse[a]+b}; NestList[nxt,{0,1},40][[All,1]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Jul 04 2018 *)
lista(nn) = my(v=vector(nn)); v[2]=1; for(n=3, nn, v[n] = v[n-1] + fromdigits(Vecrev(digits(v[n-2])))); v \\ Jinyuan Wang, Aug 01 2021
nxt[{a_,b_}]:={b,IntegerReverse[a+b]}; Flatten[Position[NestList[nxt,{0,1},500][[All,1]],?(PrimeOmega[#]==2&)]]-1 (* _Harvey P. Dale, Jun 05 2022 *)
nxt[{a_,b_}]:={b,IntegerReverse[a]+b}; Flatten[Position[NestList[nxt,{0,1},600][[All,1]],?(PrimeOmega[#]==2&)]]-1 (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale, Jul 04 2018 *)
Comments