The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A319993 a(n) = A319997(n) / A173557(n). 2
 1, -1, 1, 0, 1, -1, 1, 0, 3, -1, 1, 0, 1, -1, 1, 0, 1, -3, 1, 0, 1, -1, 1, 0, 5, -1, 9, 0, 1, -1, 1, 0, 1, -1, 1, 0, 1, -1, 1, 0, 1, -1, 1, 0, 3, -1, 1, 0, 7, -5, 1, 0, 1, -9, 1, 0, 1, -1, 1, 0, 1, -1, 3, 0, 1, -1, 1, 0, 1, -1, 1, 0, 1, -1, 5, 0, 1, -1, 1, 0, 27, -1, 1, 0, 1, -1, 1, 0, 1, -3, 1, 0, 1, -1, 1, 0, 1, -7, 3, 0, 1, -1, 1, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,9 LINKS Antti Karttunen, Table of n, a(n) for n = 1..20000 FORMULA Multiplicative with a(2^1) = -1, a(2^e) = 0 for e > 1, and a(p^e) = p^(e-1) when p is an odd prime. a(n) = A319997(n) / A173557(n). a(2n) = A003557(2n) - 2*A003557(n), a(2n+1) = A003557(2n+1). PROG (PARI) A319993(n) =  { my(f=factor(n)); prod(i=1, #f~, if(2==f[i, 1], -(1==f[i, 2]), (f[i, 1]^(f[i, 2]-1)))); }; (PARI) A173557(n) = factorback(apply(p -> p-1, factor(n)[, 1])); A319997(n) = sumdiv(n, d, (d%2)*moebius(n/d)*d); A319993(n) = (A319997(n)/A173557(n)); CROSSREFS Cf. A003557, A173557, A319997, A319999. Sequence in context: A271024 A125208 A193140 * A122776 A261609 A228488 Adjacent sequences:  A319990 A319991 A319992 * A319994 A319995 A319996 KEYWORD sign,mult AUTHOR Antti Karttunen, Nov 08 2018 STATUS approved

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

Last modified January 18 19:32 EST 2020. Contains 331029 sequences. (Running on oeis4.)