cp's OEIS Frontend

A101455 a(n) = 0 for even n, a(n) = (-1)^((n-1)/2) for odd n. Periodic sequence 1,0,-1,0,...

%I A101455 #107 Jan 05 2025 19:51:38
%S A101455 0,1,0,-1,0,1,0,-1,0,1,0,-1,0,1,0,-1,0,1,0,-1,0,1,0,-1,0,1,0,-1,0,1,0,
%T A101455 -1,0,1,0,-1,0,1,0,-1,0,1,0,-1,0,1,0,-1,0,1,0,-1,0,1,0,-1,0,1,0,-1,0,
%U A101455 1,0,-1,0,1,0,-1,0,1,0,-1,0,1,0,-1,0,1,0,-1,0,1,0,-1,0,1,0,-1,0,1,0,-1,0,1,0
%N A101455 a(n) = 0 for even n, a(n) = (-1)^((n-1)/2) for odd n. Periodic sequence 1,0,-1,0,...
%C A101455 Called X(n) (i.e., Chi(n)) in Hardy and Wright (p. 241), who show that X(n*m) = X(n)*X(m) for all n and m (i.e., X(n) is completely multiplicative) since (n*m - 1)/2 - (n - 1)/2 - (m - 1)/2 = (n - 1)*(m - 1)/2 == 0 (mod 2) when n and m are odd.
%C A101455 Same as A056594 but with offset 1.
%C A101455 From _R. J. Mathar_, Jul 15 2010: (Start)
%C A101455 The sequence is the non-principal Dirichlet character mod 4. (The principal character is A000035.)
%C A101455 Associated Dirichlet L-functions are for example L(1,chi) = Sum_{n>=1} a(n)/n = A003881, or L(2,chi) = Sum_{n>=1} a(n)/n^2 = A006752, or L(3,chi) = Sum_{n>=1} a(n)/n^3 = A153071. (End)
%C A101455 a(n) is a strong elliptic divisibility sequence t_n as given in [Kimberling, p. 16] where x = 0, y = -1, z is arbitrary. - _Michael Somos_, Nov 27 2019
%D A101455 T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1986, page 139, k=4, Chi_2(n).
%D A101455 G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 5th ed., Oxford Univ. Press, 1979, p. 241.
%H A101455 Muniru A Asiru, <a href="/A101455/b101455.txt">Table of n, a(n) for n = 0..1000</a> (a(0) prepended by Jianing Song)
%H A101455 Étienne Fouvry, Claude Levesque, Michel Waldschmidt, <a href="https://arxiv.org/abs/1712.09019">Representation of integers by cyclotomic binary forms</a>, arXiv:1712.09019 [math.NT], 2017.
%H A101455 Clark Kimberling, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/17-1/kimberling1.pdf">Strong divisibility sequences and some conjectures</a>, Fib. Quart., 17 (1979), 13-17.
%H A101455 Grant Sanderson, <a href="https://www.youtube.com/watch?v=NaL_Cb42WyY">Pi hiding in prime regularities</a>, 3Blue1Brown video (2017).
%H A101455 <a href="/index/Di#divseq">Index to divisibility sequences</a>
%H A101455 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,-1).
%F A101455 Multiplicative with a(2^e) = 0, a(p^e) = (-1)^((p^e-1)/2) otherwise. - _Mitch Harris_ May 17 2005
%F A101455 Euler transform of length 4 sequence [0, -1, 0, 1]. - _Michael Somos_, Sep 02 2005
%F A101455 G.f.: (x - x^3)/(1 - x^4) = x/(1 + x^2). - _Michael Somos_, Sep 02 2005
%F A101455 G.f. A(x) satisfies: 0 = f(A(x), A(x^2)) where f(u, v) = v - u^2 * (1 + 2*v). - _Michael Somos_, Aug 04 2011
%F A101455 a(n + 4) = a(n), a(n + 2) = a(-n) = -a(n), a(2*n) = 0, a(2*n + 1) = (-1)^n for all n in Z. - _Michael Somos_, Aug 04 2011
%F A101455 a(n + 1) = A056594(n). - _Michael Somos_, Jan 13 2014
%F A101455 REVERT transform is A126120. STIRLING transform of A009454. BINOMIAL transform is A146559. BINOMIAL transform of A009116. BIN1 transform is A108520. MOBIUS transform of A002654. EULER transform is A111335. - _Michael Somos_, Mar 30 2012
%F A101455 Completely multiplicative with a(p) = 2 - (p mod 4). - _Werner Schulte_, Feb 01 2018
%F A101455 a(n) = (-(n mod 2))^binomial(n, 2). - _Peter Luschny_, Sep 08 2018
%F A101455 a(n) = sin(n*Pi/2) = Im(i^n) where i is the imaginary unit. - _Jianing Song_, Sep 09 2018
%F A101455 From _Jianing Song_, Nov 14 2018: (Start)
%F A101455 a(n) = ((-4)/n) (or more generally, ((-4^i)/n) for i > 0), where (k/n) is the Kronecker symbol.
%F A101455 E.g.f.: sin(x).
%F A101455 Dirichlet g.f. is the Dirichlet beta function.
%F A101455 a(n) = A091337(n)*A188510(n). (End)
%e A101455 G.f. = x - x^3 + x^5 - x^7 + x^9 - x^11 + x^13 - x^15 + x^17 - x^19 + x^21 + ...
%p A101455 a := n -> `if`(n mod 2=0, 0, (-1)^((n-1)/2)):
%p A101455 seq(a(n), n=1..10^3); # _Muniru A Asiru_, Feb 02 2018
%t A101455 a[ n_] := {1, 0, -1, 0}[[ Mod[ n, 4, 1]]]; (* _Michael Somos_, Jan 13 2014 *)
%t A101455 LinearRecurrence[{0, -1}, {1, 0}, 75] (* _G. C. Greubel_, Aug 23 2018 *)
%o A101455 (PARI) {a(n) = if( n%2, (-1)^(n\2))}; /* _Michael Somos_, Sep 02 2005 */
%o A101455 (PARI) {a(n) = kronecker( -4, n)}; /* _Michael Somos_, Mar 30 2012 */
%o A101455 (GAP) a := [1, 0];; for n in [3..10^2] do a[n] := a[n-2]; od; a; # _Muniru A Asiru_, Feb 02 2018
%o A101455 (Magma) m:=75; R<x>:=PowerSeriesRing(Integers(), m); Coefficients(R!(x/(1+x^2))); // _G. C. Greubel_, Aug 23 2018
%o A101455 (Python)
%o A101455 def A101455(n): return (0,1,0,-1)[n&3] # _Chai Wah Wu_, Jun 21 2024
%Y A101455 Cf. A002654, A009116, A009454, A056594, A108520, A111335, A126120, A146559.
%Y A101455 Kronecker symbols {(d/n)} where d is a fundamental discriminant with |d| <= 24: A109017 (d=-24), A011586 (d=-23), A289741 (d=-20), A011585 (d=-19), A316569 (d=-15), A011582 (d=-11), A188510 (d=-8), A175629 (d=-7), this sequence (d=-4), A102283 (d=-3), A080891 (d=5), A091337 (d=8), A110161 (d=12), A011583 (d=13), A011584 (d=17), A322829 (d=21), A322796 (d=24).
%K A101455 sign,mult,easy
%O A101455 0,1
%A A101455 _Gerald McGarvey_, Jan 20 2005
%E A101455 a(0) prepended by _Jianing Song_, Nov 14 2024