Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006985
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006985 Fibonacci tower: a(n) = F(a(n-1)+2) (there is no room for next term).
(Formerly M0742)
+0
1
1, 2, 3, 5, 13, 610 (list; graph; listen)
OFFSET

0,2

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.

MAPLE

A006985 := proc(n) option remember; if n=0 then 1; else fibonacci(A006985(n-1)+2); fi; end;

CROSSREFS

Adjacent sequences: A006982 A006983 A006984 this_sequence A006986 A006987 A006988

Sequence in context: A038601 A114747 A041639 this_sequence A042907 A115347 A126333

KEYWORD

nonn,nice,easy

AUTHOR

njas

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research