|
Search: id:A000044
|
|
|
| A000044 |
|
Dying rabbits: a(0) = 1; for 1 <= n <= 12, a(n) = Fibonacci(n); for n >= 13, for n >= 13, a(n)=a(n-1)+a(n-2)-a(n-13).
(Formerly M0691 N0255)
|
|
+0
3
|
|
| 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 232, 375, 606, 979, 1582, 2556, 4130, 6673, 10782, 17421, 28148, 45480, 73484, 118732, 191841, 309967, 500829, 809214, 1307487, 2112571, 3413385, 5515174, 8911138, 14398164, 23263822, 37588502, 60733592, 98130253, 158553878, 256183302, 413927966, 668803781, 1080619176, 1746009572, 2821113574, 4558212008
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
A107358 is a more satisfactory version, but I have left the present sequence unchanged (except for making the definition clearer) since it has been in the OEIS so long.
|
|
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.
|
|
MAPLE
|
with(combinat); f:=proc(n) option remember; if n=0 then RETURN(1); fi; if n <= 12 then RETURN(fibonacci(n)); fi; f(n-1)+f(n-2)-f(n-13); end;
|
|
CROSSREFS
|
Cf. A107358. See A000045 for the Fibonacci numbers.
Sequence in context: A105471 A023441 A023442 this_sequence A107358 A132636 A039834
Adjacent sequences: A000041 A000042 A000043 this_sequence A000045 A000046 A000047
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas; entry revised May 25 2005
|
|
|
Search completed in 0.002 seconds
|
