login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161969 Expansion of f(q)^8 in powers of q where f() is a Ramanujan theta function. 1
1, 8, 20, 0, -70, -64, 56, 0, -125, 160, 308, 0, 110, 0, -520, 0, 57, -560, 0, 0, 182, 512, -880, 0, 1190, 448, 884, 0, 0, 0, -1400, 0, -1330, -1000, 1820, 0, -646, -1280, 0, 0, -1331, 2464, 380, 0, 1120, 0, 2576, 0, 0, 880, 1748, 0, -3850, 0, -3400, 0, 2703 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

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

LINKS

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

M. Somos, Introduction to Ramanujan theta functions

Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

FORMULA

Expansion of q^(-1/3) * (eta(q^2)^3 / (eta(q) * eta(q^4)))^8 in powers of q.

Euler transform of period 4 sequence [8, -16, 8, -8, ...].

G.f. is a period 1 Fourier series which satisfies f(-1 / (36 t)) = 1296 (t/i)^4 f(t) where q = exp(2 Pi i t).

a(n) = b(3*n + 1) where b() is multiplicative with b(3^e) = 0^e, b(2^e) = (1+(-1)^e)/2 * -(-8)^(e/2) if e>0, b(p^e) = (1+(-1)^e)/2 * (-p^3)^(e/2) if p == 5 (mod 6), b(p^e) = b(p) * b(p^(e-1)) - b(p^(e-2)) * p^3 if p == 1 (mod 6) where b(p) = (x^2-3*p) * x, 4*p = x^2 + 3 * y^2, |x| < |y| and x == 2 (mod 3).

G.f.: Product_{k>0} (1 - (-x)^k)^8.

a(n) = (-1)^n * A000731(n).

a(4*n + 3) = a(16*n + 13) = 0. a(4*n + 1) = (-1)^n * 8 * a(n).

a(2*n) = A153728(n). - Michael Somos, Sep 06 2015

EXAMPLE

G.f. = 1 + 8*x + 20*x^2 - 70*x^4 - 64*x^5 + 56*x^6 - 1258*x^8 + ...

G.f. = q + 8*q^4 + 20*q^7 - 70*q^13 - 64*q^16 + 56*q^19 - 125*q^25 + 160*q^28 + ...

MATHEMATICA

a[ n_] := SeriesCoefficient[ QPochhammer[ -x]^8, {x, 0, n}]; (* Michael Somos, Sep 06 2015 *)

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, A = factor(3*n + 1); (-1)^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, Sep 06 2015 */

(MAGMA) A := Basis( CuspForms( Gamma0(36), 4), 170); A[1] + 8*A[4] + 20*A[7] - 70*A[12]; /* Michael Somos, Sep 02 2015 */

CROSSREFS

Cf. A000731, A153728.

Sequence in context: A316201 A029845 A124972 * A000731 A034433 A282942

Adjacent sequences:  A161966 A161967 A161968 * A161970 A161971 A161972

KEYWORD

sign

AUTHOR

Michael Somos, Jun 22 2009

EXTENSIONS

Corrected by Charles R Greathouse IV, Sep 02 2009

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 January 15 20:47 EST 2019. Contains 319184 sequences. (Running on oeis4.)