|
| |
|
|
A023435
|
|
Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-5).
|
|
4
| |
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,4
|
|
|
COMMENTS
| 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
The Ca2 sums, see A180662 for the definition of these sums, of the ‘Races with Ties’ triangle A035317 lead to this sequence. [Johannes W. Meijer, Jul 20 2011]
|
|
|
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.
Z. Kasa, On scattered subword complexity, Arxiv preprint arXiv:1104.4425, 2011.
|
|
|
LINKS
| Index to sequences with linear recurrences with constant coefficients, signature (1,1,0,0,-1)
|
|
|
FORMULA
| G.f. x / ( (x-1)*(1+x)*(x^3+x-1) ). - R. J. Mathar, Nov 28 2011
|
|
|
MATHEMATICA
| a=b=c=d=0; e=1; lst={d, e}; Do[f=d+e-a; AppendTo[lst, f]; a=b; b=c; c=d; d=e; e=f, {n, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Nov 30 2009]
|
|
|
CROSSREFS
| First differences are in A013979.
Sequence in context: A118084 A117590 A173199 * A091501 A083198 A112088
Adjacent sequences: A023432 A023433 A023434 * A023436 A023437 A023438
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
