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 A023438 #22 Jul 08 2025 17:15:33
%S A023438 0,1,1,2,3,5,8,13,21,33,53,84,134,213,339,539,857,1363,2167,3446,5479,
%T A023438 8712,13852,22025,35020,55682,88535,140771,223827,355886,565861,
%U A023438 899722,1430563,2274603,3616631,5750463,9143267,14537844,23115250,36753372,58438059
%N A023438 Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-8).
%H A023438 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 A023438 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 A023438 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,0,0,0,0,0,-1).
%F A023438 G.f.: x / ( (x-1)*(x^7+x^6+x^5+x^4+x^3+x^2-1) ). - _R. J. Mathar_, Nov 29 2011
%t A023438 LinearRecurrence[{1,1,0,0,0,0,0,-1},{0,1,1,2,3,5,8,13},40] (* _Harvey P. Dale_, Nov 03 2023 *)
%o A023438 (PARI) concat(0, Vec(x / ( (x-1)*(x^7+x^6+x^5+x^4+x^3+x^2-1) ) + O(x^60))) \\ _Michel Marcus_, Sep 06 2017
%Y A023438 See A000045 for the Fibonacci numbers.
%K A023438 nonn
%O A023438 0,4
%A A023438 _N. J. A. Sloane_