login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116557 Backward iterated ( limited ) Fibonacci approximation: A000045. 0
1, 3, 6, 11, 19, 32, 52, 85, 139, 225, 365, 592, 958, 1551, 2511, 4064, 6577, 10642, 17220, 27863, 45084, 72948, 118033, 190982, 309016 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

This approximation is used to find how many generations of Fibonacci rabbits it takes to get back to the start: this is set for 25 generations at a start of populaton of an half million rabbits.

FORMULA

a(n) = Floor[a(n-1)*(-1/2+Sqrt[5])/2]

MATHEMATICA

f[0] = 500000; f[n_] := f[n] = Floor[f[n - 1]*(-1/2 + Sqrt[5]/2)] a = Table[f[n], {n, 25, 1, -1}]

CROSSREFS

Cf. A000045.

Sequence in context: A001976 A144115 A183088 * A001911 A020957 A179006

Adjacent sequences:  A116554 A116555 A116556 * A116558 A116559 A116560

KEYWORD

nonn,uned,obsc

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Mar 16 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 19:48 EST 2012. Contains 205955 sequences.