login
The OEIS is supported by the many generous donors 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; text; internal format)
OFFSET
0,2
COMMENTS
This approximation is used to determine the number of generations of Fibonacci rabbits required to get back to the start: this is set for 25 generations at a starting population of 500,000 rabbits.
LINKS
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: A144115 A183088 A326957 * A001911 A020957 A179006
KEYWORD
nonn,uned,obsc,less
AUTHOR
Roger L. Bagula, Mar 16 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 14:35 EDT 2024. Contains 371989 sequences. (Running on oeis4.)