login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A256539 Number of partitions of 4n into at most 5 parts. 2

%I #9 Jun 13 2015 00:55:27

%S 1,5,18,47,101,192,333,540,831,1226,1747,2418,3266,4319,5608,7166,

%T 9027,11229,13811,16814,20282,24260,28796,33940,39744,46262,53550,

%U 61667,70673,80631,91606,103664,116875,131310,147042,164147,182702,202787,224484,247877

%N Number of partitions of 4n into at most 5 parts.

%H Colin Barker, <a href="/A256539/b256539.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,2,-3,4,-4,3,-2,3,-3,1).

%F G.f.: -(x^7+4*x^6+5*x^5+7*x^4+6*x^3+6*x^2+2*x+1) / ((x-1)^5*(x^2+x+1)*(x^4+x^3+x^2+x+1)).

%F a(n) = A001401(4n). - _Alois P. Heinz_, Apr 01 2015

%e For n=2 the 18 partitions of 2*4 = 8 are [8], [1,7], [2,6], [3,5], [4,4], [1,1,6], [1,2,5], [1,3,4], [2,2,4], [2,3,3], [1,1,1,5], [1,1,2,4], [1,1,3,3], [1,2,2,3], [2,2,2,2], [1,1,1,1,4], [1,1,1,2,3] and [1,1,2,2,2].

%o (PARI) concat(1, vector(40, n, k=0; forpart(p=4*n, k++, , [1,5]); k))

%o (PARI) Vec(-(x^7+4*x^6+5*x^5+7*x^4+6*x^3+6*x^2+2*x+1) / ((x-1)^5*(x^2+x+1)*(x^4+x^3+x^2+x+1)) + O(x^100))

%Y Cf. A001401, A238340 (4 parts), A256540 (6 parts).

%K nonn,easy

%O 0,2

%A _Colin Barker_, Apr 01 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 02:53 EDT 2024. Contains 371906 sequences. (Running on oeis4.)