A319993 a(n) = A319997(n) / A173557(n).

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

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: A125208 A333351 A193140 * A122776 A261609 A228488

Adjacent sequences: A319990 A319991 A319992 * A319994 A319995 A319996

Keyword

sign,mult

Author

Antti Karttunen, Nov 08 2018

Status

approved