login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A332685 a(n) = Sum_{k=1..n} mu(k/gcd(n, k)). 3

%I #8 Feb 21 2020 12:30:49

%S 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,

%T -7,0,-8,-2,-10,-5,-4,-4,-13,0,-5,-4,-13,1,-15,-1,-9,-10,-5,-1,-22,-4,

%U -12,-5,-11,-1,-19,-6,-17,-6,-4,1,-28,0,-8,-12,-18,-6,-19,0,-12,-5,-17

%N a(n) = Sum_{k=1..n} mu(k/gcd(n, k)).

%C Inverse Moebius transform of A112399.

%H Ilya Gutkovskiy, <a href="/A332685/a332685.jpg">Scatterplot of a(n) up to n=10000</a>

%F a(n) = Sum_{k=1..n} mu(lcm(n, k)/n).

%F a(n) = Sum_{d|n} A112399(d).

%t Table[Sum[MoebiusMu[k/GCD[n, k]], {k, 1, n}], {n, 1, 70}]

%o (PARI) a(n) = sum(k=1, n, moebius(k/gcd(n, k))); \\ _Michel Marcus_, Feb 21 2020

%Y Cf. A002321, A007431, A007947, A008683, A063659, A112399, A276833, A304575.

%K sign

%O 1,2

%A _Ilya Gutkovskiy_, Feb 19 2020

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 1 09:54 EDT 2024. Contains 375584 sequences. (Running on oeis4.)