|
|
A080669
|
|
a(1) = 1; a(2) = 2; a(n) = Fibonacci(a(n-1) + a(n-2)) if n > 2.
|
|
0
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
a(8) has 25374 digits.
|
|
LINKS
|
|
|
MATHEMATICA
|
t = {1, 2}; For[i = 1, i <= 5, i++, l = Length[t]; t = Append[t, Fibonacci[t[[l]] + t[[l - 1]]]]]; t
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|