A023437 Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-7).

0, 1, 1, 2, 3, 5, 8, 13, 20, 32, 50, 79, 124, 195, 306, 481, 755, 1186, 1862, 2924, 4591, 7209, 11319, 17773, 27906, 43817, 68799, 108025, 169615, 266321, 418163, 656578, 1030924, 1618703, 2541602, 3990690

Offset: 0

Author

N. J. A. Sloane

Keywords

• nonn

Links

• 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.
• Index entries for linear recurrences with constant coefficients, signature (1,1,0,0,0,0,-1)

Crossrefs

See A000045 for the Fibonacci numbers.

First differences are in A013983.

Programs

Mathematica

LinearRecurrence[{1,1,0,0,0,0,-1},{0,1,1,2,3,5,8},40] (* Harvey P. Dale, Nov 06 2013 *)

Formula

G.f.: x/((x-1)*(1+x)*(x^5+x^3+x-1)). [R. J. Mathar, Jul 27 2009]