|
%I #19 Sep 08 2022 08:45:12
%S 1,-1,0,1,1,0,0,0,1,0,-1,0,0,-1,1,0,1,0,-1,-1,0,-1,1,0,0,0,-1,1,0,0,0,
%T -1,0,-1,0,0,0,0,1,0,1,0,-1,0,0,0,1,-1,1,0,0,-1,0,0,0,1,0,0,0,0,-1,0,
%U 0,-1,0,0,1,0,1,0,0,1,-1,0,0,1,0,0,0,0,-1,0,-1,0,-1,-1,0,0,0,1,1,1,0,0,-1,1,0,0,0,0,1,0,1,0,1,0,1,0,-1,0,-1,0,0,-1,0,0
%N a(n) = mu(prime(n)-1), where mu is the Moebius function (A008683).
%C Note that A049092 lists prime(n) such that a(n) = 0. Similarly, A078330 lists prime(n) such that a(n) = -1. See A088179 for prime(n) such that a(n) = 1. Also note that a(n) == A088144(n) (mod prime(n)).
%D J. V. Uspensky and M. A. Heaslet, Elementary Number Theory, McGraw-Hill, NY, 1939, p. 236.
%H Vincenzo Librandi, <a href="/A089451/b089451.txt">Table of n, a(n) for n = 1..1000</a>
%H Ed Pegg, Jr., <a href="http://www.maa.org/editorial/mathgames/mathgames_11_03_03.html">Moebius Function (and squarefree numbers)</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MoebiusFunction.html">Moebius Function</a>
%F a(n) = A067460(n) - 1. - _Benoit Cloitre_, Nov 04 2003
%F If p = prime(n), then a(n) is congruent modulo p to the sum of all primitive roots modulo p. [Uspensky and Heaslet]. - _Michael Somos_, Feb 16 2020
%t Table[MoebiusMu[Prime[n]-1], {n, 150}]
%o (PARI) a(n)=moebius(prime(n)-1)
%o (Magma) [MoebiusMu(NthPrime(n)-1): n in [1..100]]; // _Vincenzo Librandi_, Dec 23 2018
%Y Cf. A089495 (mu(p+1) for prime p), A089496 (mu(p+1)+mu(p-1) for prime p), A089497 (mu(p+1)-mu(p-1) for prime p).
%Y Cf. A049092, A078330, A088144, A088179.
%K sign
%O 1,1
%A _T. D. Noe_, Nov 03 2003
|
