OFFSET
1,8
COMMENTS
Number of divisors d of n such that phi(d) does not divide sigma(d).
Inverse Möbius transform of 1 - c(n), where c = A351114.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
MAPLE
g:= proc(n) option remember; numtheory:-sigma(n) mod numtheory:-phi(n) <> 0 end proc:
f:= n -> nops(select(g, numtheory:-divisors(n))):
map(f, [$1..100]); # Robert Israel, Aug 26 2025
MATHEMATICA
Table[Sum[Ceiling[DivisorSigma[1, d]/EulerPhi[d]] - Floor[DivisorSigma[1, d]/EulerPhi[d]], {d, Divisors[n]}], {n, 100}]
PROG
(PARI) a(n) = sumdiv(n, d, sigma(d)%eulerphi(d) != 0); \\ Michel Marcus, Aug 26 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Jul 26 2025
STATUS
approved
