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 A099132 #23 Jan 05 2025 19:51:37
%S A099132 1,1,1,1,1,1,2,7,22,57,127,253,464,804,1354,2289,4005,7372,14198,
%T A099132 28033,55523,108699,208982,394555,734561,1357136,2504932,4643816,
%U A099132 8671852,16313856,30855957,58502733,110882143,209689343,395358538,743376838
%N A099132 Quintisection of 1/(1-x^5-x^6).
%H A099132 Seiichi Manyama, <a href="/A099132/b099132.txt">Table of n, a(n) for n = 0..3646</a>
%H A099132 V. C. Harris, C. C. Styles, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/2-4/harris.pdf">A generalization of Fibonacci numbers</a>, Fib. Quart. 2 (1964) 277-289, sequence u(n,1,5).
%H A099132 V. E. Hoggatt, Jr., <a href="/A005676/a005676.pdf">7-page typed letter to N. J. A. Sloane with suggestions for new sequences</a>, circa 1977.
%H A099132 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (5,-10,10,-5,1,1)
%F A099132 G.f.: (1-x)^4/((1-x)^5-x^6);
%F A099132 a(n) = Sum_{k=0..n} binomial(k, 5(n-k));
%F A099132 a(n) = 5a(n-1)-10a(n-2)+10a(n-3)-5a(n-4)+a(n-5)+a(n-6);
%F A099132 a(n) = A017837(5n).
%F A099132 a(n) = Sum_{k=0..floor(n/5)} binomial(n-k, 5k). - _Paul Barry_, May 09 2005
%t A099132 LinearRecurrence[{5,-10,10,-5,1,1},{1,1,1,1,1,1},40] (* _Harvey P. Dale_, Aug 20 2012 *)
%o A099132 (PARI) Vec((1-x)^4/((1-x)^5-x^6) + O(x^40)) \\ _Michel Marcus_, Sep 06 2017
%Y A099132 Cf. A005676, A017837.
%K A099132 easy,nonn
%O A099132 0,7
%A A099132 _Paul Barry_, Sep 29 2004