%I A007570 M1537
%S A007570 0,1,1,1,2,5,21,233,10946,5702887,139583862445,1779979416004714189,
%T A007570 555565404224292694404015791808,
%U A007570 2211236406303914545699412969744873993387956988653
%N A007570 F(F(n)), where F is a Fibonacci number.
%D A007570 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A007570 E. A. Parberry, Two recursion relations for F(F(n)), Fib. Quart., 15 
               (1977), 122 and 139.
%H A007570 T. D. Noe, <a href="b007570.txt">Table of n, a(n) for n=0..17</a>
%H A007570 C. Street, <a href="http://www.codehappy.net/fibo.pdf">A Recurrence for 
               the Sequence {F(F(n)),n=>0}</a>
%t A007570 F[0] = 0; F[1] = 1; F[n_] := F[n] = F[n - 1] + F[n - 2]; Table[ F[ F[n] 
               ], {n, 0, 14} ]
%o A007570 (Other) sage: [fibonacci(fibonacci(n)) for n in xrange(0, 14)] # [From 
               Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 30 2009]
%Y A007570 Cf. A000045.
%Y A007570 Cf. A005371
%Y A007570 Sequence in context: A117261 A108021 A162437 this_sequence A025559 A072961 
               A042557
%Y A007570 Adjacent sequences: A007567 A007568 A007569 this_sequence A007571 A007572 
               A007573
%K A007570 nonn,nice,easy,new
%O A007570 0,5
%A A007570 N. J. A. Sloane (njas(AT)research.att.com), Robert G. Wilson v (rgwv(AT)rgwv.com)