|
%I #24 Dec 19 2021 12:25:36
%S 0,1,1,2,3,5,8,13,21,34,54,87,139,223,357,572,916,1467,2349,3762,6024,
%T 9647,15448,24738,39614,63436,101583,162670,260491,417137,667981,
%U 1069670,1712913,2742969,4392446,7033832
%N Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-9).
%H Floris P. van Doorn and Jasper Mulder, <a href="/A023439/b023439.txt">Table of n, a(n) for n = 0..2000</a>
%H J. H. E. Cohn, <a href="http://www.fq.math.ca/Scanned/2-2/cohn1.pdf">Letter to the editor</a>, Fib. Quart. 2 (1964), 108.
%H V. E. Hoggatt, Jr. and D. A. Lind, <a href="http://www.fq.math.ca/Scanned/7-5/hoggatt.pdf">The dying rabbit problem</a>, Fib. Quart. 7 (1969), 482-487.
%H <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,0,0,0,0,0,0,-1).
%F G.f.: x / ( (x-1)*(1+x)*(x^7+x^5+x^3+x-1) ). - _R. J. Mathar_, Nov 29 2011
%t LinearRecurrence[{1,1,0,0,0,0,0,0,-1},{0,1,1,2,3,5,8,13,21},40] (* _Harvey P. Dale_, Dec 19 2021 *)
%Y See A000045 for the Fibonacci numbers.
%K nonn
%O 0,4
%A _N. J. A. Sloane_
|
