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