|
%I #33 Feb 07 2024 11:55:33
%S 1,0,1,1,2,3,4,7,10,16,24,37,57,87,134,205,315,483,741,1137,1744,2676,
%T 4105,6298,9662,14823,22741,34888,53524,82114,125976,193267,296502,
%U 454881,697859,1070626,1642509
%N Expansion of 1/(1-x^2-x^3-x^4-x^5).
%C Number of compositions of n into parts p where 2 <= p < = 5. [_Joerg Arndt_, Jun 24 2013]
%H Vincenzo Librandi, <a href="/A013982/b013982.txt">Table of n, a(n) for n = 0..1000</a>
%H R. Mullen, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL12/Mullen/mullen2.html">On Determining Paint by Numbers Puzzles with Nonunique Solutions</a>, JIS 12 (2009) 09.6.5
%H J. D. Opdyke, <a href="http://dx.doi.org/10.1007/s10852-009-9116-2">A unified approach to algorithms generating unrestricted..</a>, J. Math. Model. Algor. 9 (2010) 53-97, Table 7
%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (0,1,1,1,1).
%F a(n) = a(n-5) + a(n-4) + a(n-3) + a(n-2). - _Jon E. Schoenfield_, Aug 07 2006
%t CoefficientList[Series[1/(1-x^2-x^3-x^4-x^5),{x,0,40}],x] (* or *) LinearRecurrence[{0,1,1,1,1},{1,0,1,1,2},40] (* _Harvey P. Dale_, Sep 19 2011 *)
%o (PARI) Vec(1/(1-x^2-x^3-x^4-x^5)+O(x^99)) \\ _Charles R Greathouse IV_, Sep 26 2012
%o (Magma) m:=40; R<x>:=PowerSeriesRing(Integers(), m); Coefficients(R!(1/(1-x^2-x^3-x^4-x^5))); // _Vincenzo Librandi_, Jun 24 2013
%K nonn,easy
%O 0,5
%A _N. J. A. Sloane_.
|
