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; 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.

LINKS

Index to sequences with 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)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 27 2009]

CROSSREFS

See A000045 for the Fibonacci numbers.

First differences are in A013983.

Sequence in context: A173597 A059923 A055805 * A013985 A092834 A080106

Adjacent sequences:  A023434 A023435 A023436 * A023438 A023439 A023440

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 18:01 EST 2012. Contains 206061 sequences.