Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I M0742 #26 Apr 10 2021 22:18:33
%S 1,2,3,5,13,610
%N Fibonacci tower: a(n) = F(a(n-1)+2) (there is no room for next term).
%C The next term has 128 digits. - _Harvey P. Dale_, Sep 13 2011
%D 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 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%p A006985 := proc(n) option remember; if n=0 then 1; else fibonacci(A006985(n-1)+2); fi; end;
%t NestList[Fibonacci[#+2]&,1,6] (* _Harvey P. Dale_, Sep 13 2011 *)
%o (Haskell)
%o a006985 n = a006985_list !! (n-1)
%o a006985_list = 1 : map (a000045 . (+ 2)) a006985_list
%o -- _Reinhard Zumkeller_, Jul 17 2015
%K nonn,nice,easy
%O 0,2
%A _N. J. A. Sloane_