%I A006985 M0742
%S A006985 1,2,3,5,13,610
%N A006985 Fibonacci tower: a(n) = F(a(n-1)+2) (there is no room for next term).
%D A006985 Goldstein, Arthur S.; Reingold, Edward M.; A Fibonacci version of Kraft's 
               inequality applied to discrete unimodal search. SIAM J. Comput. 22 
               (1993), no. 4, 751-777.
%D A006985 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%p A006985 A006985 := proc(n) option remember; if n=0 then 1; else fibonacci(A006985(n-1)+2); 
               fi; end;
%Y A006985 Sequence in context: A038601 A114747 A041639 this_sequence A042907 A115347 
               A126333
%Y A006985 Adjacent sequences: A006982 A006983 A006984 this_sequence A006986 A006987 
               A006988
%K A006985 nonn,nice,easy
%O A006985 0,2
%A A006985 N. J. A. Sloane (njas(AT)research.att.com).