%I A080669
%S A080669 1,2,2,3,5,21,121393
%N A080669 a(1) = 1; a(2) = 2; a(n) = Fibonacci(a(n-1) + a(n-2)) if n > 2.
%C A080669 a(8) has 25374 digits.
%t A080669 t = {1, 2}; For[i = 1, i <= 5, i++, l = Length[t]; t = Append[t, Fibonacci[t[[l]] 
               + t[[l - 1]]]]]; t
%Y A080669 Sequence in context: A152446 A055937 A090255 this_sequence A099205 A051005 
               A002163
%Y A080669 Adjacent sequences: A080666 A080667 A080668 this_sequence A080670 A080671 
               A080672
%K A080669 nonn
%O A080669 1,2
%A A080669 Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Mar 02 2003