login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A332685
a(n) = Sum_{k=1..n} mu(k/gcd(n, k)).
3
1, 2, 1, 2, 0, 2, 0, 0, -1, 0, 0, 0, -1, -2, -2, -3, 0, -4, -1, -5, -4, -2, 0, -8, -3, -4, -4, -7, 0, -8, -2, -10, -5, -4, -4, -13, 0, -5, -4, -13, 1, -15, -1, -9, -10, -5, -1, -22, -4, -12, -5, -11, -1, -19, -6, -17, -6, -4, 1, -28, 0, -8, -12, -18, -6, -19, 0, -12, -5, -17
OFFSET
1,2
COMMENTS
Inverse Moebius transform of A112399.
FORMULA
a(n) = Sum_{k=1..n} mu(lcm(n, k)/n).
a(n) = Sum_{d|n} A112399(d).
MATHEMATICA
Table[Sum[MoebiusMu[k/GCD[n, k]], {k, 1, n}], {n, 1, 70}]
PROG
(PARI) a(n) = sum(k=1, n, moebius(k/gcd(n, k))); \\ Michel Marcus, Feb 21 2020
KEYWORD
sign
AUTHOR
Ilya Gutkovskiy, Feb 19 2020
STATUS
approved