|
%I #55 Oct 27 2023 19:22:18
%S 0,1,1,2,3,5,8,13,39,124,514,836,1053,4139,12815,61135,104937,792517,
%T 1454698,9679838,17354310,9735140,1760750,986050,621360,113815,581437,
%U 1252496,7676706,13019288,94367798,178067380,173537220,106496242,265429972,522619163
%N Iccanobif numbers: reverse digits of two previous terms and add.
%H Alois P. Heinz, <a href="/A001129/b001129.txt">Table of n, a(n) for n = 0..1000</a> (terms 0..300 from T. D. Noe)
%p R:= n-> (s-> parse(cat(s[-i]$i=1..length(s))))(""||n):
%p a:= proc(n) option remember; `if`(n<2, n,
%p R(a(n-1)) +R(a(n-2)))
%p end:
%p seq(a(n), n=0..50); # _Alois P. Heinz_, Jun 18 2014
%t 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 ]
%t nxt[{a_,b_}]:={b,Total[FromDigits/@Reverse/@IntegerDigits[ {a,b}]]}; Transpose[NestList[nxt,{0,1},40]][[1]] (* _Harvey P. Dale_, Jun 22 2011 *)
%t 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 *)
%o (PARI) A001129(n,a=0,b=1)={ n || return; while( n-->0, b=A004086(a)+A004086(a=b)); b }
%o (Haskell)
%o a001129 n = a001129_list !! n
%o a001129_list = 0 : 1 : zipWith (+) iccanobifs (tail iccanobifs)
%o where iccanobifs = map a004086 a001129_list
%o -- _Reinhard Zumkeller_, Jan 01 2012
%o (Python)
%o A001129_list, r1, r2 = [0,1], 1, 0
%o for _ in range(10**2):
%o l, r2 = r1+r2, r1
%o r1 = int(str(l)[::-1])
%o A001129_list.append(l) # _Chai Wah Wu_, Jan 03 2015
%o (Magma) 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
%Y Cf. A001129, A014258, A014259, A014260.
%K nonn,base,easy,nice
%O 0,4
%A _N. J. A. Sloane_
|
