Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132972
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132972 Expansion of chi(q)^3 / chi(q^3) in powers of q where chi() is a Ramanujan theta function. +0
4
1, 3, 3, 3, 6, 9, 12, 15, 21, 30, 36, 45, 60, 78, 96, 117, 150, 189, 228, 276, 342, 420, 504, 603, 732, 885, 1050, 1245, 1488, 1773, 2088, 2454, 2901, 3420, 3996, 4662, 5460, 6378, 7404, 8583, 9972, 11565, 13344, 15378, 17748, 20448, 23472, 26910, 30876 (list; graph; listen)
OFFSET

0,2

FORMULA

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

Euler transform of period 12 sequence [ 3, -3, 2, 0, 3, -2, 3, 0, 2, -3, 3, 0, ...].

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

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

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

G.f. is a period 1 Fourier series which satisfies f(-1 / (144 t)) = g(t) where q = exp(2 pi i t) and g() is g.f. for A062244.

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

EXAMPLE

1 + 3*q + 3*q^2 + 3*q^3 + 6*q^4 + 9*q^5 + 12*q^6 + 15*q^7 + 21*q^8 + ...

PROGRAM

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

CROSSREFS

a(n) = 3 * A132975(n) unless n=0.

Sequence in context: A031502 A124449 A141094 this_sequence A113920 A081848 A079988

Adjacent sequences: A132969 A132970 A132971 this_sequence A132973 A132974 A132975

KEYWORD

nonn

AUTHOR

Michael Somos, Sep 06 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 20:00 EST 2008. Contains 151309 sequences.


AT&T Labs Research