login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131943 Expansion of b(q) * b(q^2) in powers of q where b() is a cubic AGM theta function. 5
1, -3, -3, 15, -3, -18, 15, -24, -3, 69, -18, -36, 15, -42, -24, 90, -3, -54, 69, -60, -18, 120, -36, -72, 15, -93, -42, 231, -24, -90, 90, -96, -3, 180, -54, -144, 69, -114, -60, 210, -18, -126, 120, -132, -36, 414, -72, -144, 15, -171, -93, 270, -42, -162 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Cubic AGM theta functions: a(q) (see A004016), b(q) (A005928), c(q) (A005882).

REFERENCES

N. J. Fine, Basic Hypergeometric Series and Applications, Amer. Math. Soc., 1988; p. 84, Eq. (32.65).

LINKS

Table of n, a(n) for n=0..53.

FORMULA

Expansion of eta(q)^3 * eta(q^2)^3 / (eta(q^3) * eta(q^6)) in powers of q.

Euler transform of period 6 sequence [ -3, -6, -2, -6, -3, -4, ...].

a(n) = -3 * b(n) where b() is multiplicative with b(2^e) = 1, b(3^e) = 4 - 3^(e+1), b(p^e) = (p^(e+1) - 1) / (p - 1) if p>3. - Michael Somos, Nov 21 2013

G.f. is a period 1 Fourier series which satisfies f(-1 / (6 t)) = 54 (t/i)^2 g(t) where q = exp(2 Pi i t) and g() is the g.f. for A121443.

G.f.: Product_{k>0} ((1 - x^k) * (1 - x^(2*k)))^3 / ((1 - x^(3*k)) * (1 - x^(6*k))).

G.f.: 1 - 3 * (Sum_{k>0} (6*k - 1) * x^(6*k - 1) / (1 - x^(6*k - 1)) - 2*(6*k - 5) * x^(6*k - 3) / (1 - x^(6*k - 3)) + (6*k - 5) * x^(6*k - 5) / (1 -x^(6*k - 5))).

a(n) = a(2*n). a(n) = -3 * A131944(n) unless n=0. a(3^n) = 3 * A168611(n+1). a(2*n + 1) = -3 * A134077(n). - Michael Somos, Nov 21 2013

EXAMPLE

G.f. = 1 - 3*q - 3*q^2 + 15*q^3 - 3*q^4 - 18*q^5 + 15*q^6 - 24*q^7 - 3*q^8 +...

MATHEMATICA

a[ n_] := SeriesCoefficient[ QPochhammer[ q]^3 QPochhammer[ q^2]^3 / (QPochhammer[ q^3] QPochhammer[ q^6]), {q, 0, n}]; (* Michael Somos, Nov 21 2013 *)

a[ n_] := If[ n < 1, Boole[n == 0], -3 Sum[ d {0, 1, 0, -2, 0, 1}[[ Mod[ d, 6] + 1]], {d, Divisors @ n}]]; (* Michael Somos, Nov 11 2015 *)

PROG

(PARI) {a(n) = if( n<1, n==0, -3 * sumdiv(n, d, d * ((d%6==1) + (d%6==5) - 2 * (d%6==3))))};

(PARI) {a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( (eta(x + A) * eta(x^2 + A))^3 / (eta(x^3 + A) * eta(x^6 + A)), n))};

(PARI) {a(n) = my(A, p, e); if( n<1, n==0, A = factor(n); -3 * prod( k=1, matsize(A)[1], [p, e] = A[k, ]; if( p==2, 1, p==3, 4 - 3^(e+1), (p^(e+1) - 1) / (p - 1) )))}; /* Michael Somos, Nov 21 2013 */

(MAGMA) A := Basis( ModularForms( Gamma0(6), 2), 54); A[1] - 3*A[2] - 3*A[3]; /* Michael Somos, Aug 30 2014 */

(Sage) A = ModularForms( Gamma0(6), 2, prec=54) . basis();  A[0] - 3*A[1] - 3*A[2]; # Michael Somos, Nov 21 2013

CROSSREFS

Cf. A121443, A131944, A134077, A168611.

Sequence in context: A282264 A281213 A282388 * A226139 A260119 A282009

Adjacent sequences:  A131940 A131941 A131942 * A131944 A131945 A131946

KEYWORD

sign

AUTHOR

Michael Somos, Jul 30 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 9 16:50 EDT 2020. Contains 335545 sequences. (Running on oeis4.)