OFFSET
0,2
COMMENTS
Number 22 of the 74 eta-quotients listed in Table I of Martin (1996).
Denoted by g_4(q) in Cynk and Hulek in Remark 3.4 on page 12 as the unique level 9 form of weight 4.
This is a member of an infinite family of integer weight modular forms. g_1 = A033687, g_2 = A030206, g_3 = A130539, g_4 = A000731. - Michael Somos, Aug 24 2012
a(n)=0 if and only if A033687(n)=0 (see the Han-Ono paper). - Emeric Deutsch, May 16 2008
REFERENCES
Newman, Morris; A table of the coefficients of the powers of eta(tau). Nederl. Akad. Wetensch. Proc. Ser. A. 59 = Indag. Math. 18 (1956), 204-216.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Seiichi Manyama, Table of n, a(n) for n = 0..10000
M. Boylan, Exceptional congruences for the coefficients of certain eta-product newforms, J. Number Theory 98 (2003), no. 2, 377-389. MR1955423 (2003k:11071)
S. Cooper, M. D. Hirschhorn and R. Lewis, Powers of Euler's Product and Related Identities, The Ramanujan Journal, Vol. 4 (2), 137-155 (2000).
S. Cynk and K. Hulek, Construction and examples of higher-dimensional modular Calabi-Yau manifolds, arXiv:math/0509424 [math.AG], 2005-2006.
S. R. Finch, Powers of Euler's q-Series, arXiv:math/0701251 [math.NT], 2007.
G.-N. Han and Ken Ono, Hook lengths and 3-cores
Y. Martin, Multiplicative eta-quotients, Trans. Amer. Math. Soc. 348 (1996), no. 12, 4825-4856, see page 4852 Table I.
M. Newman, A table of the coefficients of the powers of eta(tau), Nederl. Akad. Wetensch. Proc. Ser. A. 59 = Indag. Math. 18 (1956), 204-216. [Annotated scanned copy]
FORMULA
Expansion of q^(-1/3) * eta(q)^8 in powers of q.
Expansion of q^(-1/3) * b(q)^3 * c(q) / 3 in powers of q where b(), c() are cubic AGM theta functions. - Michael Somos, Nov 08 2006
Expansion of q^(-1) * b(q) * c(q)^3 / 27 in powers of q^3 where b(), c() are cubic AGM theta functions. - Michael Somos, Nov 08 2006
Euler transform of period 1 sequence [ -8, ...].
a(n) = b(3*n + 1) where b(n) is multiplicative and b(3^e) = 0^e, b(p^e) = (1 + (-1)^e)/2 * (-1)^(e/2) * p^(3*e/2) if p == 2 (mod 3), b(p^e) = b(p)*b(p^(e-1)) - b(p^(e-2))*p^3 if p == 1 (mod 3) where b(p) = (x^2 - 3*p)*x, 4*p = x^2 + 3*y^2, |x|<|y| and x == 2 (mod 3). - Michael Somos, Aug 23 2006
Given g.f. A(x), then B(x) = x * A(x^3) satisfies 0 = f(B(x), B(x^2), B(x^4)) where f(u, v, w) = v^3 - u * w * (u + 16 * w). - Michael Somos, Feb 19 2007
G.f. is a period 1 Fourier series which satisfies f(-1 / (9 t)) = 81 (t/i)^4 f(t) where q = exp(2 Pi i t). - Michael Somos, Sep 29 2011
G.f.: Product_{k>0} (1 - x^k)^8.
a(2*n) = A153728(n). - Michael Somos, Sep 29 2011
a(4*n + 1) = -8 * a(n). - Michael Somos, Dec 06 2004
a(4*n + 3) = a(16*n + 13) = 0. - Michael Somos, Oct 19 2005
Sum_{n>=0} a(n) * q^(3*n + 1) = (Sum_{i,j,k in Z} (i-j) * (j-k) * (k-i) * q^((i*i + j*j + k*k) / 2)) / 2 where 0 = i+j+k, i == 1 (mod 3), j == 2 (mod 3), and k == 0 (mod 3). - Michael Somos, Sep 22 2014
a(0) = 1, a(n) = -(8/n)*Sum_{k=1..n} A000203(k)*a(n-k) for n > 0. - Seiichi Manyama, Mar 27 2017
G.f.: exp(-8*Sum_{k>=1} x^k/(k*(1 - x^k))). - Ilya Gutkovskiy, Feb 05 2018
Let M = p_1*...*p_k be a positive integer whose prime factors p_i (not necessarily distinct) are all congruent to 2 (mod 3). Then a( M^2*n + (M^2 - 1)/3 ) = (-1)^k*M^3*a(n). See Cooper et al., Theorem 1. - Peter Bala, Dec 01 2020
a(n) = b(3*n + 1) where b(n) is multiplicative and b(3^e) = 0^e, b(p^e) = (1 + (-1)^e)/2 * (-p^3)^(e/2) if p == 2 (mod 3), b(p^e) = (((x+sqrt(-3)*y)/2)^(3*e+3) - ((x-sqrt(-3)*y)/2)^(3*e+3))/(((x+sqrt(-3)*y)/2)^3 - ((x-sqrt(-3)*y)/2)^3) if p == 1 (mod 3) where 4*p = x^2 + 3*y^2, |x|<|y| and x == 2 (mod 3). - Jianing Song, Mar 19 2022
EXAMPLE
G.f. = 1 - 8*x + 20*x^2 - 70*x^3 + 64*x^4 + 56*x^5 - 125*x^6 - 160*x^7 + ...
G.f. = q - 8*q^4 + 20*q^7 - 70*q^13 + 64*q^16 + 56*q^19 - 125*q^25 - ...
MATHEMATICA
a[ n_] := SeriesCoefficient[ QPochhammer[ x]^8, {x, 0, n}]; (* Michael Somos, Sep 29 2011 *)
a[ n_] := SeriesCoefficient[ Product[ 1 - x^k, {k, n}]^8, {x, 0, n}]; (* Michael Somos, Dec 09 2013 *)
PROG
(PARI) {a(n) = if( n<0, 0, polcoeff( eta(x + x * O(x^n))^8, n))};
(PARI) {a(n) = my(A, p, e, x, y, a0, a1); if( n<0, 0, n = 3*n + 1; A = factor(n); prod( k=1, matsize(A)[1], [p, e] = A[k, ]; if( p==3, 0, p%3==2, if( e%2, 0, (-1)^(e/2) * p^(3*e/2)), forstep( y=sqrtint(4*p\3), sqrtint(p\3), -1, if( issquare( 4*p - 3*y^2, &x), if( x%3!=2, x=-x); break)); a0=1; a1 = y = x * (x^2 - 3*p); for( i=2, e, x = y*a1 - p^3*a0; a0=a1; a1=x); a1)))}; /* Michael Somos, Aug 23 2006 */
(Sage) CuspForms( Gamma0(9), 4, prec=56).0; # Michael Somos, May 28 2013
(Magma) Basis( CuspForms( Gamma0(9), 4), 56) [1]; /* Michael Somos, Dec 09 2013 */
CROSSREFS
KEYWORD
sign,easy
AUTHOR
EXTENSIONS
Corrected by Charles R Greathouse IV, Sep 02 2009
STATUS
approved