login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001129 Iccanobif numbers: reverse digits of two previous terms and add. 30
0, 1, 1, 2, 3, 5, 8, 13, 39, 124, 514, 836, 1053, 4139, 12815, 61135, 104937, 792517, 1454698, 9679838, 17354310, 9735140, 1760750, 986050, 621360, 113815, 581437, 1252496, 7676706, 13019288, 94367798, 178067380 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

LINKS

T. D. Noe, Table of n, a(n) for n=0..300

MATHEMATICA

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]] (* From Harvey P. Dale, June 22 2011 *)

PROG

(PROG) A001129(n, a=0, b=1)={ n | return; while( n-->0, b=A004086(a)+A004086(a=b)); b }

(Haskell)

a001129 n = a001129_list !! n

a001129_list = 0 : 1 : zipWith (+) iccanobifs (tail iccanobifs)

   where iccanobifs = map a004086 a001129_list

-- Reinhard Zumkeller, Jan 01 2012

CROSSREFS

Cf. A000045, A001129, A014258-A014260.

See A000045 for the Fibonacci numbers.

Sequence in context: A158083 A042163 A014259 * A041957 A096095 A041101

Adjacent sequences:  A001126 A001127 A001128 * A001130 A001131 A001132

KEYWORD

nonn,base,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 13:19 EST 2012. Contains 205797 sequences.