|
|
A098108
|
|
a(n) = 1 if n is an odd square, otherwise 0.
|
|
17
|
|
|
0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
Motivated by expansion of Jacobi theta function theta_2(x) = Sum_{m = -oo..oo} x^((m+1/2)^2) = 2*Sum_{m odd > 0} q^(m^2/4).
a(n) for n >= 1 is also equal to the Ramanujan number A000594(n) read mod 2. This follows from a theorem started by V. Kumar Murty (2011). Thanks to Benoit Cloitre for this reference. - N. J. A. Sloane, Aug 29 2017
The identification of this sequence with A000594 mod 2 was answered in Mathematics Stack Exchange question 71251. The idea is that (1 - q - q^2 + q^5 + q^7 - ...)^3 = 1 - 3*q + 5*q^3 - 7*q^6 + ... . Reduce mod 2 giving 1 + q + q^3 + q^6 + ... and using (x + y)^2 == (x^2 + y^2) (mod 2) three times gives (1 + q + q^3 + q^6 + ...)^8 == (1 + q^8 + q^24 + q^48 + ...) (mod 2) and we are done. - Michael Somos, Sep 12 2017
|
|
REFERENCES
|
Louis Comtet, Advanced Combinatorics, Reidel, 1974, p. 104, [5n].
J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 102.
Nathan J. Fine, Basic Hypergeometric Series and Applications, Amer. Math. Soc., 1988; p. 93, Eq. (34.12).
E. T. Whittaker and G. N. Watson, A Course of Modern Analysis, Cambridge Univ. Press, 4th ed., 1963, p. 464.
|
|
LINKS
|
V. Kumar Murty, The Tau of Ramanujan, Slides of a talk given at the Indian Institute of Science Education and Research, Bhopal, India, Oct 10, 2011. See slide 63/95.
|
|
FORMULA
|
Multiplicative with a(p^e) = 1 if 2 divides e and p > 2, 0 otherwise. - Mitch Harris, Jun 09 2005
Dirichlet g.f.: zeta(2*s)*(1-2^(-2*s)). - R. J. Mathar, Mar 10 2011
Euler transform of period 16 sequence [ 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, -1, ...]. - Michael Somos, Jun 08 2012
For n > 0, a(n) = floor( (sqrt(n)+1)/2 ) - floor( (sqrt(n-1)+1)/2 ). - Mikael Aaltonen, Mar 08 2015
G.f.: eta quotient eta(16*tau)^2/eta(8*tau) = q*Product_{n>=1} (1-q^(16*n))^2 / Product_{n>=1} (1-q^(8*n)), with q = exp(2*Pi*I*z), Im(z) > 0. See the Ono et al. reference, p. 4. - Wolfdieter Lang, Jan 11 2017
|
|
EXAMPLE
|
G.f. = q + q^9 + q^25 + q^49 + q^81 + q^121 + q^169 + q^225 + q^289 + q^361 + ...
|
|
MAPLE
|
add(x^((m+1/2)^2), m=-10..10);
# alternative
if issqr(n) and type(n, 'odd') then
1;
else
0 ;
end if;
end proc:
|
|
MATHEMATICA
|
Table[If[OddQ@ n && IntegerQ@ Sqrt[n], 1, 0], {n, 0, 120}] (* Michael De Vlieger, Mar 08 2015 *)
|
|
PROG
|
(PARI) {a(n) = n%2 && issquare( n)}; /* Michael Somos, Jun 08 2012 */
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,mult
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|