A143259 a(n) = 1 if n is a nonzero square, -1 if n is twice a nonzero square, 0 otherwise.

1, -1, 0, 1, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 1, 0, -1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 1, 0, 0, 0, 0, 0

Offset

1,1

Comments

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

Links

Antti Karttunen, Table of n, a(n) for n = 1..65537

S. Cooper and M. Hirschhorn, On some infinite product identities, Rocky Mountain J. Math., 31 (2001) 131-139. see p. 133 Theorem 1.

Michael Somos, Introduction to Ramanujan theta functions

Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

Formula

Expansion of (phi(q) - phi(q^2)) / 2 = q * psi(q^4) * f(-q, -q^7) / f(-q^3, -q^5) in powers of q where phi(), psi() and f() are Ramanujan theta functions.

Expansion of q * f(-q, -q^7)^2 / psi(-q) in powers of q where psi(), f() are Ramanujan theta functions. - Michael Somos, Jan 01 2015

Euler transform of period 8 sequence [ -1, 0, 1, 1, 1, 0, -1, -1, ...].

a(2*n) = -a(n) for all n in Z.

a(n) is multiplicative with a(2^e) = (-1)^e, a(p^e) = (1 + (-1)^e) / 2 if p == 1 (mod 2).

Dirichlet g.f.: zeta(2*s) * (1 - 2^-s); Dirichlet convolution of A010052 and A154955.

G.f. A(x) satisfies: A(x) / A(x^2) = -1 + A111374(x).

G.f. A(x) satisfies: A(x^2) = - (A(x) + A(-x)) / 2.

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 + 2*w).

G.f.: (theta_3(q) - theta_3(q^2)) / 2 = Sum_{k>0} x^(k^2) - x^(2k^2).

|a(n)| = A053866(n).

a(n) = A008836(n)*A053866(n). - Jon Maiga, Jan 11 2019

Sum_{k=1..n} a(k) ~ (1 - 1/sqrt(2)) * sqrt(n). - Vaclav Kotesovec, Oct 16 2020

Example

G.f. = q - q^2 + q^4 - q^8 + q^9 + q^16 - q^18 + q^25 - q^32 + q^36 + q^49 - q^50 + ...

Mathematica

f[n_]:=Which[IntegerQ[Sqrt[n/2]], -1, IntegerQ[Sqrt[n]], 1, True, 0]; Array[f, 110] (* Harvey P. Dale, Jul 07 2011 *)
a[ n_] := Boole[ IntegerQ[ Sqrt[n]]] - Boole[ IntegerQ[ Sqrt[2 n]]]; (* Michael Somos, Jun 10 2014 *)
a[ n_] := SeriesCoefficient[ (EllipticTheta[ 3, 0, q] - EllipticTheta[ 3, 0, q^2])/2, {q, 0, n}]; (* Michael Somos, Jun 10 2014 *)
Table[LiouvilleLambda[n]*Mod[DivisorSigma[1, n], 2], {n, 100}] (* Jon Maiga, Jan 11 2019 *)

Prog

(PARI) {a(n) = issquare(n) - issquare(2*n)};
(PARI) {a(n) = if( n<1, 0, n--; polcoeff( prod(k=1, n, (1 - x^k)^([1, 1, 0, -1, -1, -1, 0, 1][k%8 + 1]), 1 + x * O(x^n)), n))};
(Magma) Basis( ModularForms( Gamma1(8), 1/2), 100) [2] ; /* Michael Somos, Jun 10 2014 */

Crossrefs

Cf. A008836, A010052, A053866, A111374, A154955.

Sequence in context: A354199 A214509 A053866 * A359818 A207710 A207735

Adjacent sequences: A143256 A143257 A143258 * A143260 A143261 A143262

Keyword

sign,mult

Author

Michael Somos, Aug 02 2008

Status

approved