This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A023441 #16 Jul 08 2025 17:15:40
%S A023441 0,1,1,2,3,5,8,13,21,34,55,89,143,231,372,600,967,1559,2513,4051,6530,
%T A023441 10526,16967,27350,44086,71064,114550,184647,297638,479772,773359,
%U A023441 1246601,2009434,3239068,5221152,8416134
%N A023441 Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-11).
%H A023441 J. H. E. Cohn, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/2-2/cohn1.pdf">Letter to the editor</a>, Fib. Quart. 2 (1964), 108.
%H A023441 V. E. Hoggatt, Jr. and D. A. Lind, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/7-5/hoggatt.pdf">The dying rabbit problem</a>, Fib. Quart. 7 (1969), 482-487.
%H A023441 <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,0,0,0,0,0,0,0,0,-1).
%F A023441 G.f.: x/((x-1)*(1+x)*(x^9+x^7+x^5+x^3+x-1)). [_R. J. Mathar_, Jul 27 2009]
%t A023441 LinearRecurrence[{1,1,0,0,0,0,0,0,0,0,-1},{0,1,1,2,3,5,8,13,21,34,55},40] (* _Harvey P. Dale_, Jun 06 2022 *)
%o A023441 (PARI) concat(0, Vec(x/((x-1)*(1+x)*(x^9+x^7+x^5+x^3+x-1)) + O(x^50))) \\ _Michel Marcus_, Sep 06 2017
%Y A023441 See A000045 for the Fibonacci numbers.
%K A023441 nonn
%O A023441 0,4
%A A023441 _N. J. A. Sloane_