|
| |
|
|
A007570
|
|
F(F(n)), where F is a Fibonacci number.
(Formerly M1537)
|
|
17
| |
|
|
0, 1, 1, 1, 2, 5, 21, 233, 10946, 5702887, 139583862445, 1779979416004714189, 555565404224292694404015791808, 2211236406303914545699412969744873993387956988653
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,5
|
|
|
COMMENTS
| Asymptotic behaviour as n->infinity: a(n+1)=a(n)*phi^(F(n-1)), with phi = A001622 = 1.61803... (golden ratio). [Carmine Suriano, Jan 24 2011]
|
|
|
REFERENCES
| E. A. Parberry, Two recursion relations for F(F(n)), Fib. Quart., 15 (1977), 122 and 139.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=0..17
C. Street, A Recurrence for the Sequence {F(F(n)),n=>0}
|
|
|
MATHEMATICA
| F[0] = 0; F[1] = 1; F[n_] := F[n] = F[n - 1] + F[n - 2]; Table[ F[ F[n] ], {n, 0, 14} ]
|
|
|
PROG
| (Other) sage: [fibonacci(fibonacci(n)) for n in xrange(0, 14)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 30 2009]
|
|
|
CROSSREFS
| Cf. A000045.
Cf. A005371
Sequence in context: A117261 A108021 A162437 * A173313 A174143 A025559
Adjacent sequences: A007567 A007568 A007569 * A007571 A007572 A007573
|
|
|
KEYWORD
| nonn,nice,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Robert G. Wilson v (rgwv(AT)rgwv.com)
|
| |
|
|
