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 A023440 #25 Jan 05 2025 19:51:35 %S A023440 0,1,1,2,3,5,8,13,21,34,55,88,142,228,367,590,949,1526,2454,3946,6345, %T A023440 10203,16406,26381,42420,68211,109682,176367,283595,456016,733266, %U A023440 1179079,1895939,3048637,4902156,7882582 %N A023440 Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-10). %H A023440 Matthew House, <a href="/A023440/b023440.txt">Table of n, a(n) for n = 0..4825</a> %H A023440 John 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 A023440 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 A023440 <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 A023440 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 A023440 See A000045 for the Fibonacci numbers. %K A023440 nonn,easy %O A023440 0,4 %A A023440 _N. J. A. Sloane_