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 A121832 #32 Sep 10 2024 17:29:40
%S A121832 1,1,1,1,1,2,4,6,8,10,13,19,29,43,61,84,116,164,236,340,485,685,965,
%T A121832 1365,1941,2766,3936,5586,7916,11222,15929,22631,32153,45655,64793,
%U A121832 91944,130504,185288,263096,373544,530281,752729,1068521,1516905
%N A121832 Expansion of 1/(1-x-x^5-x^6).
%C A121832 Number of compositions of n into parts 1, 5, and 6. [_Joerg Arndt_, Sep 03 2013]
%H A121832 Vincenzo Librandi, <a href="/A121832/b121832.txt">Table of n, a(n) for n = 0..1000</a>
%H A121832 Michael A. Allen, <a href="https://arxiv.org/abs/2409.00624">Connections between Combinations Without Specified Separations and Strongly Restricted Permutations, Compositions, and Bit Strings</a>, arXiv:2409.00624 [math.CO], 2024. See p. 18.
%H A121832 Said Amrouche and Hacène Belbachir, <a href="https://doi.org/10.3906/mat-1811-109">Unimodality and linear recurrences associated with rays in the Delannoy triangle</a>, Turkish Journal of Mathematics (2019) Vol. 44, 118-130.
%H A121832 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,1,1).
%F A121832 a(n) = a(n-1) + a(n-5) + a(n-6).
%F A121832 a(n) = Sum_{k=0..floor(n/5)} A008288(n-4*k, k). - _Johannes W. Meijer_, Jul 19 2013
%t A121832 CoefficientList[Series[1 / (1 - x - x^5 - x^6), {x, 0, 50}], x] (* _Vincenzo Librandi_, Sep 03 2013 *)
%t A121832 LinearRecurrence[{1,0,0,0,1,1},{1,1,1,1,1,2},50] (* _Harvey P. Dale_, Mar 30 2018 *)
%o A121832 (Magma) I:=[1,1,1,1,1,2]; [n le 6 select I[n] else Self(n-1)+Self(n-5)+Self(n-6): n in [1..50]]; // _Vincenzo Librandi_, Sep 03 2013
%Y A121832 Cf. A008288.
%K A121832 easy,nonn
%O A121832 0,6
%A A121832 _Jon E. Schoenfield_, Aug 27 2006