cp's OEIS Frontend

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.

A202088 Number of partitions of 5n such that cn(0,5) < cn(1,5) = cn(4,5) = cn(2,5) = cn(3,5).

Original entry on oeis.org

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
Offset: 0

Views

Author

Max Alekseyev, Dec 11 2011

Keywords

Comments

For a given partition, cn(i,n) means the number of its parts equal to i modulo n.

Crossrefs

Programs

  • 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

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

Extensions

a(0)=0 prepended by Andrew Howroyd, Sep 16 2019