login

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”).

A006985
Fibonacci tower: a(n) = F(a(n-1)+2) (there is no room for next term).
(Formerly M0742)
1
1, 2, 3, 5, 13, 610
OFFSET
0,2
COMMENTS
The next term has 128 digits. - Harvey P. Dale, Sep 13 2011
REFERENCES
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.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
MAPLE
A006985 := proc(n) option remember; if n=0 then 1; else fibonacci(A006985(n-1)+2); fi; end;
MATHEMATICA
NestList[Fibonacci[#+2]&, 1, 6] (* Harvey P. Dale, Sep 13 2011 *)
PROG
(Haskell)
a006985 n = a006985_list !! (n-1)
a006985_list = 1 : map (a000045 . (+ 2)) a006985_list
-- Reinhard Zumkeller, Jul 17 2015
CROSSREFS
Sequence in context: A372228 A114747 A041639 * A042907 A115347 A173654
KEYWORD
nonn,nice,easy
STATUS
approved