OFFSET
1,2
COMMENTS
Möbius transform of A230593.
The number of integers k from 1 to n such that gcd(n, k) is a noncomposite number. - Amiram Eldar, Jun 21 2025
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..20000
FORMULA
Sum_{k=1..n} a(k) ~ 3 * (1 + A085548) * n^2 / Pi^2. - Vaclav Kotesovec, Nov 20 2021
MATHEMATICA
a[n_] := DivisorSum[n, Boole[!CompositeQ[#]] * EulerPhi[n/#] &]; Array[a, 100] (* Amiram Eldar, Nov 17 2021 *)
PROG
(PARI) A349338(n) = sumdiv(n, d, eulerphi(n/d)*((1==d)||isprime(d)));
(PARI) a(n) = {my(f = factor(n), p = f[, 1], e = f[, 2]); n * vecprod(apply(x -> 1-1/x, p)) * (1 + vecsum(apply(x -> 1/x, p - vector(#e, i, e[i] == 1)~))); } \\ Amiram Eldar, Jun 21 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 17 2021
STATUS
approved
