|
Search: id:A023439
|
|
|
| A023439 |
|
Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-9). |
|
+0
1
|
|
| 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 54, 87, 139, 223, 357, 572, 916, 1467, 2349, 3762, 6024, 9647, 15448, 24738, 39614, 63436, 101583, 162670, 260491, 417137, 667981, 1069670, 1712913, 2742969, 4392446, 7033832
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
REFERENCES
|
J. H. E. Cohn, Letter to the editor, Fib. Quart. 2 (1964), 108.
V. E. Hoggatt, Jr. and D. A. Lind, The dying rabbit problem, Fib. Quart. 7 (1969), 482-487.
|
|
LINKS
|
Floris P. van Doorn and Jasper Mulder, Table of n, a(n) for n=0,...,5000.
|
|
CROSSREFS
|
See A000045 for the Fibonacci numbers.
Sequence in context: A111917 A013986 A121343 this_sequence A147660 A013987 A023440
Adjacent sequences: A023436 A023437 A023438 this_sequence A023440 A023441 A023442
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
