editing
approved
with(numtheory);
A063514:=proc(q)
local n; for n from 1 to q do print(sigma(n) mod phi(n)); od; end:
A063514(1000000); # Paolo P. Lava, Jan 31 2013
(MAGMAMagma) [SumOfDivisors(n) mod EulerPhi(n): n in [1..85]]; // Bruno Berselli, Jan 31 2013
OEIS Server: https://oeis.org/edit/global/2944
proposed
a(p^2) = 2*p+1, for prime p>=5. - Michel Marcus, Apr 07 2020
reviewed
If a(n)=0, then n is a balanced number (A020492).
