login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A023437 Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-7). 2
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Table of n, a(n) for n=0..35.

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)

FORMULA

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

MATHEMATICA

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

CROSSREFS

See A000045 for the Fibonacci numbers.

First differences are in A013983.

Sequence in context: A059923 A266331 A055805 * A322332 A225394 A013985

Adjacent sequences:  A023434 A023435 A023436 * A023438 A023439 A023440

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 17 13:12 EST 2019. Contains 329230 sequences. (Running on oeis4.)