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!)
A332686 a(n) = Sum_{k=1..n} phi(k/gcd(n, k)). 2

%I #12 Mar 13 2021 10:05:27

%S 1,2,3,5,7,9,13,18,21,23,33,33,47,49,51,67,81,76,103,97,103,119,151,

%T 135,163,173,185,189,243,185,279,280,265,299,291,291,397,379,369,371,

%U 491,381,543,491,455,553,651,539,653,610,643,683,831,689,743,753,801,887,1029

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

%C Inverse Moebius transform of A053570.

%H Seiichi Manyama, <a href="/A332686/b332686.txt">Table of n, a(n) for n = 1..10000</a>

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

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

%t Table[Sum[EulerPhi[k/GCD[n, k]], {k, 1, n}], {n, 1, 59}]

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

%Y Cf. A000010, A002088, A029935, A029939, A053570, A332685.

%K nonn

%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 April 23 08:33 EDT 2024. Contains 371905 sequences. (Running on oeis4.)