|
Search: id:A007570
|
|
|
| A007570 |
|
F(F(n)), where F is a Fibonacci number.
(Formerly M1537)
|
|
+0
16
|
|
| 0, 1, 1, 1, 2, 5, 21, 233, 10946, 5702887, 139583862445, 1779979416004714189, 555565404224292694404015791808, 2211236406303914545699412969744873993387956988653
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
REFERENCES
|
E. A. Parberry, Two recursion relations for F(F(n)), Fib. Quart., 15 (1977), 122 and 139.
|
|
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} ]
|
|
CROSSREFS
|
Cf. A000045.
Cf. A005371
Sequence in context: A139153 A117261 A108021 this_sequence A025559 A072961 A042557
Adjacent sequences: A007567 A007568 A007569 this_sequence A007571 A007572 A007573
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
njas, Robert G. Wilson v (rgwv(AT)rgwv.com)
|
|
|
Search completed in 0.002 seconds
|
