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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A023438 Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-8). 3
0, 1, 1, 2, 3, 5, 8, 13, 21, 33, 53, 84, 134, 213, 339, 539, 857, 1363, 2167, 3446, 5479, 8712, 13852, 22025, 35020, 55682, 88535, 140771, 223827, 355886, 565861, 899722, 1430563, 2274603, 3616631, 5750463 (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,0,-1).

FORMULA

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

PROG

(PARI) concat(0, Vec(x / ( (x-1)*(x^7+x^6+x^5+x^4+x^3+x^2-1) ) + O(x^60))) \\ Michel Marcus, Sep 06 2017

CROSSREFS

See A000045 for the Fibonacci numbers.

Sequence in context: A278800 A286938 A055806 * A117760 A181600 A111917

Adjacent sequences:  A023435 A023436 A023437 * A023439 A023440 A023441

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 December 12 09:36 EST 2019. Contains 329953 sequences. (Running on oeis4.)