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”).

A342541
a(n) = Sum_{k=1..n} phi(gcd(k, n))^(n/gcd(k, n)).
4
1, 2, 4, 5, 8, 10, 12, 14, 28, 28, 20, 62, 24, 54, 272, 68, 32, 198, 36, 676, 1224, 130, 44, 1348, 4136, 180, 3540, 3426, 56, 12632, 60, 1640, 22520, 304, 129456, 22370, 72, 378, 101808, 270952, 80, 192996, 84, 40630, 1867184, 550, 92, 551528, 1679700, 4198860, 2105408
OFFSET
1,2
LINKS
FORMULA
a(n) = Sum_{d|n} phi(n/d) * phi(d)^(n/d).
If p is prime, a(p) = 2 *(p-1).
MATHEMATICA
a[n_] := DivisorSum[n, EulerPhi[n/#] * EulerPhi[#]^(n/#) &]; Array[a, 50] (* Amiram Eldar, Mar 15 2021 *)
PROG
(PARI) a(n) = sum(k=1, n, eulerphi(gcd(k, n))^(n/gcd(k, n)));
(PARI) a(n) = sumdiv(n, d, eulerphi(n/d)*eulerphi(d)^(n/d));
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Mar 15 2021
STATUS
approved