The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A202088 Number of partitions of 5n such that cn(0,5) < cn(1,5) = cn(4,5) = cn(2,5) = cn(3,5). 8
 0, 0, 1, 4, 11, 25, 55, 116, 245, 505, 1026, 2030, 3936, 7450, 13837, 25210, 45206, 79831, 139136, 239471, 407582, 686346, 1144532, 1890837, 3096692, 5029412, 8104448, 12961576, 20582130, 32459992, 50859769, 79192204, 122572743 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS For a given partition, cn(i,n) means the number of its parts equal to i modulo n. LINKS Andrew Howroyd, Table of n, a(n) for n = 0..1000 FORMULA a(n) = A036888(n) - A036893(n). a(n) = A202087(n) - A046776(n). G.f.: Sum_{k>=0} x^(2*k)*(1-x^k)/(Product_{j=1..k} 1 - x^j)^5. - Andrew Howroyd, Sep 16 2019 PROG (PARI) seq(n)={Vec(sum(k=0, n\2, x^(2*k)*(1-x^k)/prod(j=1, k, 1 - x^j + O(x*x^n))^5) + O(x*x^n), -(n+1))} \\ Andrew Howroyd, Sep 16 2019 CROSSREFS Cf. A036888, A036893, A046776, A202087. Sequence in context: A262158 A156127 A178742 * A328937 A328936 A266816 Adjacent sequences:  A202085 A202086 A202087 * A202089 A202090 A202091 KEYWORD nonn AUTHOR Max Alekseyev, Dec 11 2011 EXTENSIONS a(0)=0 prepended by Andrew Howroyd, Sep 16 2019 STATUS approved

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

Last modified July 24 10:49 EDT 2021. Contains 346273 sequences. (Running on oeis4.)