|
Search: id:A107358
|
|
|
| A107358 |
|
Dying rabbits: a(n) = Fibonacci(n) for n <= 12; for n >= 13, a(n)=a(n-1)+a(n-2)-a(n-13). |
|
+0
2
|
|
| 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 376, 608, 982, 1587, 2564, 4143, 6694, 10816, 17476, 28237, 45624, 73717, 119108, 192449, 310949, 502416, 811778, 1311630, 2119265, 3424201, 5532650, 8939375, 14443788, 23337539, 37707610, 60926041, 98441202, 159056294
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
In the limit, the growth rate is 1.61575... per generation as opposed to 1.61803... for Fibonacci numbers. - T. D. Noe, Jan 22 2009
|
|
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
|
T. D. Noe, Table of n, a(n) for n=0..500
|
|
FORMULA
|
G.f.: x/((x-1)*(1+x)*(x^11+x^9+x^7+x^5+x^3+x-1)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 27 2009]
|
|
MAPLE
|
with(combinat); f:=proc(n) option remember; if n <= 12 then RETURN(fibonacci(n)); fi; f(n-1)+f(n-2)-f(n-13); end;
|
|
CROSSREFS
|
See A000045 for the Fibonacci numbers. This is a better version of A000044.
Adjacent sequences: A107355 A107356 A107357 this_sequence A107359 A107360 A107361
Sequence in context: A023441 A023442 A000044 this_sequence A132636 A152163 A039834
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), May 25 2005
|
|
|
Search completed in 0.002 seconds
|
