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!)
A093829 Expansion of q * psi(q^3)^3 / psi(q) in powers of q where psi() is a Ramanujan theta function. 17
1, -1, 1, 1, 0, -1, 2, -1, 1, 0, 0, 1, 2, -2, 0, 1, 0, -1, 2, 0, 2, 0, 0, -1, 1, -2, 1, 2, 0, 0, 2, -1, 0, 0, 0, 1, 2, -2, 2, 0, 0, -2, 2, 0, 0, 0, 0, 1, 3, -1, 0, 2, 0, -1, 0, -2, 2, 0, 0, 0, 2, -2, 2, 1, 0, 0, 2, 0, 0, 0, 0, -1, 2, -2, 1, 2, 0, -2, 2, 0, 1, 0, 0, 2, 0, -2, 0, 0, 0, 0, 4, 0, 2, 0, 0, -1, 2, -3, 0, 1, 0, 0, 2, -2, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,7

COMMENTS

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).

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

LINKS

G. C. Greubel, Table of n, a(n) for n = 1..1000

M. Somos, Introduction to Ramanujan theta functions

Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

FORMULA

Expansion of (a(q) - a(q^2)) / 6 = c(q^2)^2 / (3 * c(q)) in powers of q where a(), c() are cubic AGM functions. - Michael Somos, Sep 06 2007

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

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

Moebius transform is period 6 sequence [ 1, -2, 0, 2, -1, 0, ...] = A112300. - Michael Somos, Jul 16 2006

Multiplicative with a(p^e) = (-1)^e if p=2; a(p^e) = 1 if p=3; a(p^e) = 1+e if p == 1 (mod 6); a(p^e) = (1 + (-1)^e) / 2 if p == 5 (mod 6).

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

G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^4)) where f(u, v, w) = w * (u + v)^2 - v * (v + w) * (v + 4*w).

G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^3), A(x^6)) where f(u1, u2, u3, u6) = u2 * (u2 - u3 - 4*u6) - (u3 + u6) * (u1 - 3*u3 - 3*u6).

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

a(n) = -(-1)^n * A113447(n). - Michael Somos, Jan 31 2015

a(2*n) = -a(n). a(3*n) = a(n). a(6*n + 5) = 0.

A035178(n) = |a(n)|. A033762(n) = a(2*n + 1). A033687(n) = a(3*n + 1).

a(4*n + 1) = A112604(n). a(4*n + 3) = A112605(n). a(6*n + 1) = A097195(n). a(8*n + 1) = A112606(n). a(8*n + 3) = A112608(n). a(8*n + 5) = 2 * A112607(n).

EXAMPLE

G.f. = q - q^2 + q^3 + q^4 - q^6 + 2*q^7 - q^8 + q^9 + q^12 + 2*q^13 + ...

MATHEMATICA

a[ n_] := If[ n < 1, 0, DivisorSum[ n, {1, -2, 0, 2, -1, 0} [[ Mod[#, 6, 1]]] &]];

QP = QPochhammer; s = (QP[q]*QP[q^6]^6)/(QP[q^2]^2*QP[q^3]^3) + O[q]^105; CoefficientList[s, q] (* Jean-Fran├žois Alcover, Nov 30 2015, adapted from PARI *)

PROG

(PARI) {a(n) = if( n<1, 0, polcoeff( sum( k=0, n, x^k * (1 - x^k)^2 / (1 + x^(2*k) + x^(4*k)), x * O(x^n)), n))};

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

(PARI) {a(n) = if( n<1, 0, sumdiv( n, d, kronecker( -12, d) - if( d%2==0, 2 * kronecker( -3, d/2) ) ))}; /* Michael Somos, May 29 2005 */

(Sage) ModularForms( Gamma1(6), 1, prec=90).1; # Michael Somos, Sep 27 2013

(MAGMA) Basis( ModularForms( Gamma1(6), 1), 90) [2]; /* Michael Somos, Jul 02 2014 */

CROSSREFS

Cf. A033687, A033762, A035178, A112300, A113447, A122859.

Cf. A097195, A112604, A112605, A112606, A112607, A112608. - Michael Somos, Sep 27 2013

Sequence in context: A196346 A261884 A035178 * A113447 A137608 A191336

Adjacent sequences:  A093826 A093827 A093828 * A093830 A093831 A093832

KEYWORD

sign,mult

AUTHOR

Michael Somos, Apr 17 2004

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 October 1 00:23 EDT 2020. Contains 337440 sequences. (Running on oeis4.)