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.

A300574 Coefficient of x^n in 1/((1-x)(1+x^3)(1-x^5)(1+x^7)(1-x^9)...).

Original entry on oeis.org

1, 1, 1, 0, 0, 1, 2, 1, 0, 0, 2, 2, 1, 0, 2, 3, 2, 0, 2, 4, 4, 0, 1, 4, 6, 2, 1, 4, 8, 4, 2, 4, 10, 6, 2, 3, 12, 10, 4, 2, 13, 14, 8, 2, 14, 18, 12, 2, 14, 22, 18, 3, 14, 26, 26, 6, 14, 29, 34, 10, 14, 32, 44, 16, 14, 34, 56, 26, 16, 34, 67, 38, 20, 34, 78, 52, 26
Offset: 0

Views

Author

Gus Wiseman, Mar 08 2018

Keywords

Comments

By Theorem 1 of Craig, the values a(n) in this list are known to be nonnegative. Combined with Theorem 2 of Seo and Yee, this shows that a(n) = |number of partitions of n into odd parts with an odd index minus the number of partitions of n into odd parts with an even index|. - William Craig, Dec 31 2021

References

  • Seunghyun Seo and Ae Ja Yee, Index of seaweed algebras and integer partitions, Electronic Journal of Combinatorics, 27:1 (2020), #P1.47. See Conjecture 1 and Theorem 2.

Crossrefs

Programs

  • Mathematica
    CoefficientList[Series[1/QPochhammer[x, -x^2], {x, 0, 100}], x]
    nmax = 100; CoefficientList[Series[Product[1/((1+x^(4*k-1))*(1-x^(4*k-3))), {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Jun 04 2019 *)

Formula

O.g.f.: Product_{n >= 0} 1/(1 - (-1)^n x^(2n+1)).
a(n) = Sum (-1)^k where the sum is over all integer partitions of n into odd parts and k is the number of parts not congruent to 1 modulo 4.
a(n) has average order Gamma(1/4) * exp(sqrt(n/3)*Pi/2) / (2^(9/4) * 3^(1/8) * Pi^(3/4) * n^(5/8)). - Vaclav Kotesovec, Jun 04 2019