OFFSET
1,2
COMMENTS
Inverse Möbius transform of phi(n^tau(n)). - Wesley Ivan Hurt, Jun 09 2023
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..10000
FORMULA
Equals the logarithmic derivative of A179114.
a(n) = Sum_{k=1..n} phi(gcd(n,k)^tau(gcd(n,k)))/phi(n/gcd(n,k)). - Richard L. Ollerton, May 09 2021
MAPLE
a:= proc(n) uses numtheory; add(phi(d^tau(d)), d=divisors(n)) end:
seq(a(n), n=1..40); # Alois P. Heinz, Sep 21 2024
MATHEMATICA
a[n_] := Sum[EulerPhi[d^DivisorSigma[0, d]], {d, Divisors[n]}];
Table[a[n], {n, 1, 40}] (* Jean-François Alcover, Jul 23 2025 *)
PROG
(PARI) {a(n)=sumdiv(n, d, eulerphi(d^sigma(d, 0)))}
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Jul 10 2010
EXTENSIONS
Offset changed to 1 by Georg Fischer, Sep 21 2024
STATUS
approved
