login
A304575
a(n) = Sum_{d|n} #{k < d, k squarefree and relatively prime to d}.
6
1, 2, 3, 4, 4, 6, 6, 8, 7, 8, 8, 12, 9, 12, 12, 15, 12, 16, 13, 17, 16, 18, 16, 24, 17, 20, 20, 23, 18, 26, 20, 28, 23, 26, 24, 33, 24, 29, 28, 35, 27, 35, 29, 37, 34, 35, 31, 46, 32, 38, 35, 41, 33, 45, 36, 47, 38, 42, 37, 54, 38, 46, 46, 54, 42, 53, 42, 54
OFFSET
1,2
COMMENTS
Note that a(n) <= n.
LINKS
FORMULA
a(n) = Sum_{d|n} A073311(d) (inverse Moebius transform of A073311). - Amiram Eldar, Nov 21 2024
From Ridouane Oudra, Oct 17 2025: (Start)
a(n) = Sum_{k=1..n} A008966(lcm(n,k)/n).
a(n) = Sum_{k=1..n} A008966(k/gcd(n,k)).
a(p^(2*m)) = 1 + Sum_{i=0..m} A013928(p^(2*i)), for p prime and m >= 0.
a(p^(2*m+1)) = 1 + Sum_{i=0..m} A013928(p^(2*i+1)). (End)
MATHEMATICA
s[n_]:=Length[Select[Range[n], And[SquareFreeQ[#], GCD[n, #]===1]&]];
Table[DivisorSum[n, s], {n, 100}]
PROG
(PARI) a(n) = sumdiv(n, d, #select(k->(issquarefree(k) && (gcd(k, d)==1)), [1..d])); \\ Michel Marcus, May 15 2018
KEYWORD
nonn
AUTHOR
Gus Wiseman, May 14 2018
STATUS
approved