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!)
A046786 Number of partitions of n with equal nonzero number of parts congruent to each of 0, 2, 3 and 4 (mod 5). 2

%I #9 Sep 16 2019 21:08:28

%S 0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,5,6,6,6,6,16,21,22,22,23,43,58,

%T 63,64,68,104,139,155,160,175,236,307,347,364,405,509,640,727,772,874,

%U 1054,1285,1456,1562,1784,2106,2501,2819,3046,3502,4084,4756,5322,5782

%N Number of partitions of n with equal nonzero number of parts congruent to each of 0, 2, 3 and 4 (mod 5).

%H Andrew Howroyd, <a href="/A046786/b046786.txt">Table of n, a(n) for n = 0..1000</a>

%F G.f.: (Sum_{k>0} x^(14*k)/(Product_{j=1..k} 1 - x^(5*j))^3)/(Product_{j>=0} 1 - x^(5*j+1)). - _Andrew Howroyd_, Sep 16 2019

%o (PARI) seq(n)={Vec(sum(k=1, n\14, x^(14*k)/prod(j=1, k, 1 - x^(5*j) + O(x*x^(n-14*k)))^4)/prod(j=0, n\5, 1 - x^(5*j+1) + O(x*x^n)), -(n+1))} \\ _Andrew Howroyd_, Sep 16 2019

%Y Cf. A046787.

%K nonn

%O 0,20

%A _David W. Wilson_

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 18 08:27 EDT 2024. Contains 371769 sequences. (Running on oeis4.)