login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
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.
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