A023440 Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-10).

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 88, 142, 228, 367, 590, 949, 1526, 2454, 3946, 6345, 10203, 16406, 26381, 42420, 68211, 109682, 176367, 283595, 456016, 733266, 1179079, 1895939, 3048637, 4902156, 7882582

Offset: 0

Author

N. J. A. Sloane

Keywords

• nonn
• easy

Links

• Matthew House, Table of n, a(n) for n = 0..4825
• John 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.
• Index entries for linear recurrences with constant coefficients, signature (1,1,0,0,0,0,0,0,0,-1).

Crossrefs

See A000045 for the Fibonacci numbers.

Formula

G.f.: x/((x - 1)*(x^9 + x^8 + x^7 + x^6 + x^5 + x^4 + x^3 + x^2 - 1)). - R. J. Mathar, Nov 29 2011