OFFSET
1,4
COMMENTS
Case k=4, i=1 of Gordon Theorem.
REFERENCES
G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 109.
FORMULA
a(n) ~ exp(2*Pi*sqrt(n)/3) / (6 * (1+2*cos(2*Pi/9)) * n^(3/4)). - Vaclav Kotesovec, Nov 12 2015
MAPLE
# See A035937 for GordonsTheorem
A035940_list := n -> GordonsTheorem([0, 1, 1, 1, 1, 1, 1, 0, 0], n):
A035940_list(40) # Peter Luschny, Jan 22 2012
MATHEMATICA
nmax = 60; Rest[CoefficientList[Series[Product[1 / ((1 - x^(9*k-2)) * (1 - x^(9*k-3)) * (1 - x^(9*k-4)) * (1 - x^(9*k-5)) * (1 - x^(9*k-6)) * (1 - x^(9*k-7)) ), {k, 1, nmax}], {x, 0, nmax}], x]] (* Vaclav Kotesovec, Nov 12 2015 *)
PROG
(Sage) # See A035937 for GordonsTheorem
def A035940_list(len) : return GordonsTheorem([0, 1, 1, 1, 1, 1, 1, 0, 0], len)
A035940_list(40) # Peter Luschny, Jan 22 2012
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved