The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A115660 Expansion of (phi(q) * phi(q^6) - phi(q^2) * phi(q^3)) / 2 in powers of q where phi() is a Ramanujan theta function. 12
1, -1, -1, 1, -2, 1, 2, -1, 1, 2, -2, -1, 0, -2, 2, 1, 0, -1, 0, -2, -2, 2, 0, 1, 3, 0, -1, 2, -2, -2, 2, -1, 2, 0, -4, 1, 0, 0, 0, 2, 0, 2, 0, -2, -2, 0, 0, -1, 3, -3, 0, 0, -2, 1, 4, -2, 0, 2, -2, 2, 0, -2, 2, 1, 0, -2, 0, 0, 0, 4, 0, -1, 2, 0, -3, 0, -4, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Number 41 of the 74 eta-quotients listed in Table I of Martin (1996). - Michael Somos, Mar 14 2012
LINKS
A. Berkovich and H. Yesilyurt, Ramanujan's identities and representation of integers by certain binary and quaternary quadratic forms, arXiv:math/0611300 [math.NT], 2006-2007.
Y. Martin, Multiplicative eta-quotients, Trans. Amer. Math. Soc. 348 (1996), no. 12, 4825-4856, see page 4852 Table I.
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions
FORMULA
Expansion of eta(q) * eta(q^4) * eta(q^6) * eta(q^24) / (eta(q^3) * eta(q^8)) in powers of q.
Euler transform of period 24 sequence [ -1, -1, 0, -2, -1, -1, -1, -1, 0, -1, -1, -2, -1, -1, 0, -1, -1, -1, -1, -2, 0, -1, -1, -2, ...].
a(n) is multiplicative with a(2^e) = a(3^e) = (-1)^e, a(p^e) = e+1 if p == 1, 7 (mod 24), a(p^e) = (e+1) * (-1)^e if p == 5, 11 (mod 24), a(p^e) = (1 + (-1)^e) / 2 if p == 13, 17, 19, 23 (mod 24).
G.f. is a period 1 Fourier series which satisfies f(-1 / (24 t)) = 24^(1/2) (t/i) f(t) where q = exp(2 Pi i t).
G.f.: Sum_{k>0} Kronecker(k,8) * x^k / (1 + x^k + x^(2*k)) = Sum_{k>0} Kronecker(k,3) * x^k * (1 - x^(2*k)) / (1 + x^(4*k)).
abs(a(n)) = A000377(n). a(n) = (-1)^n * A128581(n). a(2*n) = a(3*n) = -a(n). a(2*n + 1) = A128580(n). - Michael Somos, Mar 14 2012
abs(a(n)) = A192013(n) unless n=0. - Michael Somos, Oct 22 2015
a(3*n + 1) = A263571(n). a(4*n) = A259668(n). a(6*n + 1) = A261115(n). a(6*n + 4) = A263548(n). a(8*n + 1) = A260308(n). - Michael Somos, Oct 22 2015
a(n) = A000377(n) - A108563(n) = A046113(n) - A000377(n). - Michael Somos, Oct 22 2015
EXAMPLE
G.f. = q - q^2 - q^3 + q^4 - 2*q^5 + q^6 + 2*q^7 - q^8 + q^9 + 2*q^10 - 2*q^11 + ...
MATHEMATICA
a[ n_] := SeriesCoefficient[ q QPochhammer[ q] QPochhammer[ q^4] QPochhammer[ q^6] QPochhammer[ q^24] / (QPochhammer[ q^3] QPochhammer[ q^8]), {q, 0, n}]; (* Michael Somos, Apr 19 2015 *)
a[ n_] := SeriesCoefficient[ (EllipticTheta[ 3, 0, q] EllipticTheta[ 3, 0, q^6] - EllipticTheta[ 3, 0, q^2] EllipticTheta[ 3, 0, q^3]) / 2, {q, 0, n}]; (* Michael Somos, Apr 19 2015 *)
a[ n_] := If[ n < 1, 0, Sum[ KroneckerSymbol[ 2, d] KroneckerSymbol[ -3, n/d], {d, Divisors[ n]}]]; (* Michael Somos, Apr 19 2015 *)
a[ n_] := If[ n < 1, 0, Times @@ (Which[ # == 1, 1, # < 5, (-1)^#2, Mod[#, 24] < 12, (#2 + 1) KroneckerSymbol[ #, 12]^#2, True, 1 - Mod[#2, 2]]& @@@ FactorInteger[n])]; (* Michael Somos, Oct 22 2015 *)
PROG
(PARI) {a(n) = my(A, p, e); if( n<1, 0, A = factor(n); prod( k=1, matsize(A)[1], [p, e] = A[k, ]; if( p<5, (-1)^e, p%24<12, (e+1) * kronecker( p, 12)^e, 1-e%2)))};
(PARI) {a(n) = my(A); if( n<1, 0, n--; A = x * O(x^n); polcoeff( eta(x + A) * eta(x^4 + A) * eta(x^6 + A) * eta(x^24 + A) / (eta(x^3 + A) * eta(x^8 + A)), n))};
(PARI) {a(n) = if( n<1, 0, sumdiv( n, d, kronecker( 2, d) * kronecker( -3, n/d)))};
CROSSREFS
Sequence in context: A321601 A366461 A261122 * A128581 A190611 A000377
KEYWORD
sign,mult
AUTHOR
Michael Somos, Jan 28 2006
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 3 00:27 EDT 2024. Contains 373054 sequences. (Running on oeis4.)