|
%I #12 Aug 29 2021 12:50:26
%S 0,1,1,2,3,5,8,13,21,34,55,89,144,232,375,605,977,1577,2546,4110,6635,
%T 10711,17291,27913,45060,72741,117426,189562,306011,493996,797461,
%U 1287347,2078173,3354809,5415691,8742587
%N Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-12).
%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_12">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1).
%F G.f.: x/ ( (x-1)*(x^11+x^10+x^9+x^8+x^7+x^6+x^5+x^4+x^3+x^2-1) ). - _R. J. Mathar_, Nov 29 2011
%t LinearRecurrence[{1,1,0,0,0,0,0,0,0,0,0,-1},{0,1,1,2,3,5,8,13,21,34,55,89},40] (* _Harvey P. Dale_, Aug 29 2021 *)
%o (PARI) concat(0, Vec(x/ ( (x-1)*(x^11+x^10+x^9+x^8+x^7+x^6+x^5+x^4+x^3+x^2-1) ) + O(x^50))) \\ _Michel Marcus_, Sep 06 2017
%Y See A000045 for the Fibonacci numbers.
%K nonn
%O 0,4
%A _N. J. A. Sloane_.
|
