This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A058051 a(n) = F(F(F(n))), where F is a Fibonacci number (A000045). 4
 0, 1, 1, 1, 1, 5, 10946, 2211236406303914545699412969744873993387956988653 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 COMMENTS a(8) = 1695216512..7257812353 has 2288 decimal digits and a(9) = 3525796792..4659808333 has 1191833 decimal digits. - Alois P. Heinz, Nov 11 2015 LINKS MAPLE F:= n-> (<<0|1>, <1|1>>^n)[1, 2]: a:= n-> F(F(F(n))): seq(a(n), n=0..7);  # Alois P. Heinz, Nov 11 2015 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} ] Table[Nest[Fibonacci, n, 3], {n, 0, 8}] (* Harvey P. Dale, Feb 09 2018 *) CROSSREFS Cf. A000045, A007570, A262361. Sequence in context: A101846 A292742 A260262 * A242772 A089989 A219011 Adjacent sequences:  A058048 A058049 A058050 * A058052 A058053 A058054 KEYWORD easy,nonn AUTHOR Robert G. Wilson v, Nov 18 2000 EXTENSIONS Offset corrected by Alois P. Heinz, Nov 11 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 21 04:18 EST 2019. Contains 320371 sequences. (Running on oeis4.)