|
| |
|
|
A023441
|
|
Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-11).
|
|
1
| |
|
|
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 143, 231, 372, 600, 967, 1559, 2513, 4051, 6530, 10526, 16967, 27350, 44086, 71064, 114550, 184647, 297638, 479772, 773359, 1246601, 2009434, 3239068, 5221152, 8416134
(list; graph; refs; listen; history; internal format)
|
|
|
|
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.
|
|
|
FORMULA
| G.f.: x/((x-1)*(1+x)*(x^9+x^7+x^5+x^3+x-1)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 27 2009]
|
|
|
CROSSREFS
| See A000045 for the Fibonacci numbers.
Sequence in context: A093091 A105471 A189722 * A023442 A000044 A107358
Adjacent sequences: A023438 A023439 A023440 * A023442 A023443 A023444
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
