Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A140829
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A140829 a(0)=1. a(n) = ceiling(F(n)/a(n-1)), where F(n) is the nth Fibonacci number. +0
1
1, 1, 1, 2, 2, 3, 3, 5, 5, 7, 8, 12, 12, 20, 19, 33, 30, 54, 48, 88, 77, 143, 124, 232, 200, 376, 323, 609, 522, 986, 844, 1596, 1365, 2583, 2208, 4180, 3572, 6764, 5779, 10945, 9350, 17710, 15128, 28656, 24477, 46367, 39604, 75024, 64080, 121392, 103683 (list; graph; listen)
OFFSET

0,4

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

MAPLE

with(combinat): a:=proc(n) if n=0 then 1 else ceil(fibonacci(n)/a(n-1)) end if end proc: seq(a(n), n=0..50); [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 09 2008]

CROSSREFS

Sequence in context: A008484 A026797 A027189 this_sequence A116575 A090492 A103609

Adjacent sequences: A140826 A140827 A140828 this_sequence A140830 A140831 A140832

KEYWORD

nonn

AUTHOR

Leroy Quet Jul 18 2008

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 09 2008

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research