|
Search: id:A116557
|
|
|
| A116557 |
|
Backward iterated ( limited ) Fibonacci approximation: A000045. |
|
+0
1
|
|
| 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; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
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: A114089 A001976 A144115 this_sequence A001911 A020957 A116365
Adjacent sequences: A116554 A116555 A116556 this_sequence A116558 A116559 A116560
|
|
KEYWORD
|
nonn,uned,probation,obsc
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Mar 16 2006
|
|
|
Search completed in 0.002 seconds
|
