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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A058051 F(F(F(n))), where F is a Fibonacci number (A000045). 0
0, 1, 1, 1, 1, 5, 10946, 2211236406303914545699412969744873993387956988653 (list; graph; refs; listen; history; internal format)
OFFSET

1,6

MATHEMATICA

F[0] = 0; F[1] = 1; F[n_] := F[n] = F[n - 1] + F[n - 2]; Table[ F[ F[ F[n] ] ], {n, 0, 10} ]

CROSSREFS

Cf. A000045.

Sequence in context: A109514 A022918 A160741 * A089989 A185686 A083976

Adjacent sequences:  A058048 A058049 A058050 * A058052 A058053 A058054

KEYWORD

easy,nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 18 2000

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 05:45 EST 2012. Contains 205694 sequences.