|
%I #2 Feb 11 2014 19:05:42
%S 1,2,2,3,5,21,121393
%N a(1) = 1; a(2) = 2; a(n) = Fibonacci(a(n-1) + a(n-2)) if n > 2.
%C a(8) has 25374 digits.
%t t = {1, 2}; For[i = 1, i <= 5, i++, l = Length[t]; t = Append[t, Fibonacci[t[[l]] + t[[l - 1]]]]]; t
%K nonn
%O 1,2
%A _Joseph L. Pe_, Mar 02 2003
|
