OFFSET
1,2
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..2500
FORMULA
a(n) is multiplicative with a(2^n) = (-64)^n, a(p^e) = a(p) * a(p^(e-1)) - p^13 * a(p^(e-2)) if p>2.
G.f. is a period 1 Fourier series which satisfies f(-1 / (2 t)) = -128 (t/i)^14 f(t) where q = exp(2 Pi i t).
a(2*n) = -64 * a(n).
EXAMPLE
G.f. = q - 64*q^2 - 1836*q^3 + 4096*q^4 + 3990*q^5 + 117504*q^6 - 433432*q^7 + ...
MATHEMATICA
eta[q_] := q^(1/24)*QPochhammer[q]; A := eta[q]^8; B := 32*eta[q^4]^8; Drop[CoefficientList[Series[A*(A + B)*(A^2 - 2*A*B - B^2)/eta[q^2]^4, {q, 0, 50}], q], 1] (* G. C. Greubel, Aug 09 2018 *)
PROG
(PARI) {a(n) = my(A, u1, u4); if( n<1, 0, n--; A = x * O(x^n); u1 = eta(x + A)^8; u4 = 32 * x * eta(x^4 + A)^8; polcoeff( u1 * (u1 + u4) * (u1^2 - 2* u1 * u4 - u4^2) / eta(x^2 + A)^4, n))};
(Sage) A = CuspForms( Gamma1(2), 14, prec=28) . basis(); A[0] - 64*A[1];
(Magma) A := Basis( CuspForms( Gamma1(2), 14), 28); A[1] - 64*A[2];
CROSSREFS
KEYWORD
sign,mult
AUTHOR
Michael Somos, May 22 2013
STATUS
approved