%I #23 Dec 24 2018 03:35:31
%S 0,1,1,2,3,5,8,13,21,34,55,88,142,228,367,590,949,1526,2454,3946,6345,
%T 10203,16406,26381,42420,68211,109682,176367,283595,456016,733266,
%U 1179079,1895939,3048637,4902156,7882582
%N Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-10).
%H Matthew House, <a href="/A023440/b023440.txt">Table of n, a(n) for n = 0..4825</a>
%H John 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_10">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,0,0,0,0,0,0,0,-1).
%F G.f.: x/((x - 1)*(x^9 + x^8 + x^7 + x^6 + x^5 + x^4 + x^3 + x^2 - 1)). - _R. J. Mathar_, Nov 29 2011
%Y See A000045 for the Fibonacci numbers.
%K nonn,easy
%O 0,4
%A _N. J. A. Sloane_