

A023439


Dying rabbits: a(n) = a(n1) + a(n2)  a(n9).


2



0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 54, 87, 139, 223, 357, 572, 916, 1467, 2349, 3762, 6024, 9647, 15448, 24738, 39614, 63436, 101583, 162670, 260491, 417137, 667981, 1069670, 1712913, 2742969, 4392446, 7033832
(list;
graph;
refs;
listen;
history;
text;
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), 482487.


LINKS

Floris P. van Doorn and Jasper Mulder, Table of n, a(n) for n=0,...,5000.
Index to sequences with linear recurrences with constant coefficients, signature (1,1,0,0,0,0,0,0,1).


FORMULA

G.f. x / ( (x1)*(1+x)*(x^7+x^5+x^3+x1) ).  R. J. Mathar, Nov 29 2011


CROSSREFS

See A000045 for the Fibonacci numbers.
Sequence in context: A013986 A121343 A236768 * A147660 A013987 A206139
Adjacent sequences: A023436 A023437 A023438 * A023440 A023441 A023442


KEYWORD

nonn


AUTHOR

N. J. A. Sloane.


STATUS

approved



