|
%I #19 Sep 06 2017 11:38:03
%S 0,1,1,2,3,5,8,13,20,32,50,79,124,195,306,481,755,1186,1862,2924,4591,
%T 7209,11319,17773,27906,43817,68799,108025,169615,266321,418163,
%U 656578,1030924,1618703,2541602,3990690
%N Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-7).
%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_07">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,0,0,0,0,-1)
%F G.f.: x/((x-1)*(1+x)*(x^5+x^3+x-1)). [_R. J. Mathar_, Jul 27 2009]
%t LinearRecurrence[{1,1,0,0,0,0,-1},{0,1,1,2,3,5,8},40] (* _Harvey P. Dale_, Nov 06 2013 *)
%Y See A000045 for the Fibonacci numbers.
%Y First differences are in A013983.
%K nonn
%O 0,4
%A _N. J. A. Sloane_.
|
