|
|
A006985
|
|
Fibonacci tower: a(n) = F(a(n-1)+2) (there is no room for next term).
(Formerly M0742)
|
|
1
|
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
|
|
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).
|
|
LINKS
|
|
|
MAPLE
|
A006985 := proc(n) option remember; if n=0 then 1; else fibonacci(A006985(n-1)+2); fi; end;
|
|
MATHEMATICA
|
|
|
PROG
|
(Haskell)
a006985 n = a006985_list !! (n-1)
a006985_list = 1 : map (a000045 . (+ 2)) a006985_list
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|