|
Search: id:A023435
|
|
|
| A023435 |
|
Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-5). |
|
+0
3
|
|
| 0, 1, 1, 2, 3, 5, 7, 11, 16, 24, 35, 52, 76, 112, 164, 241, 353, 518, 759, 1113, 1631, 2391, 3504, 5136, 7527, 11032, 16168, 23696, 34728, 50897, 74593, 109322, 160219, 234813, 344135, 504355, 739168
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Diagonal sums of Riordan array (1/(1-x), x(1+x+x^2)) yield a(n+1). - Paul Barry (pbarry(AT)wit.ie), Feb 16 2005
|
|
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.
|
|
CROSSREFS
|
First differences are in A013979.
Sequence in context: A024791 A118084 A117590 this_sequence A091501 A083198 A112088
Adjacent sequences: A023432 A023433 A023434 this_sequence A023436 A023437 A023438
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
