OFFSET
1,2
LINKS
Seiichi Manyama, Table of n, a(n) for n = 1..386
FORMULA
a(n) = Sum_{k=1..n} phi(k) * floor(n/k)^n.
a(n) ~ n^n. - Vaclav Kotesovec, May 23 2021
MATHEMATICA
a[n_] := Sum[EulerPhi[k] * Quotient[n, k]^n, {k, 1, n}]; Array[a, 20] (* Amiram Eldar, May 22 2021 *)
PROG
(PARI) a(n) = sum(k=1, n, eulerphi(k)*(n\k)^n);
(Python)
from sympy import totient
def A344525(n): return sum(totient(k)*(n//k)**n for k in range(1, n+1)) # Chai Wah Wu, Aug 05 2024
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, May 22 2021
STATUS
approved