|
| |
|
|
A063514
|
|
a(n) = sigma(n) mod phi(n).
|
|
1
|
|
|
|
0, 0, 0, 1, 2, 0, 2, 3, 1, 2, 2, 0, 2, 0, 0, 7, 2, 3, 2, 2, 8, 6, 2, 4, 11, 6, 4, 8, 2, 0, 2, 15, 8, 6, 0, 7, 2, 6, 8, 10, 2, 0, 2, 4, 6, 6, 2, 12, 15, 13, 8, 2, 2, 12, 32, 0, 8, 6, 2, 8, 2, 6, 32, 31, 36, 4, 2, 30, 8, 0, 2, 3, 2, 6, 4, 32, 36, 0, 2, 26, 13, 6, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,5
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n = 1..2000
|
|
|
EXAMPLE
|
If a(n)=0, then n is a balanced number (A020492).
|
|
|
MAPLE
|
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.
|
|
|
PROG
|
(PARI) { for (n=1, 2000, write("b063514.txt", n, " ", sigma(n)%eulerphi(n)) ) } \\ Harry J. Smith, Aug 24 2009
(MAGMA) [SumOfDivisors(n) mod EulerPhi(n): n in [1..85]]; // Bruno Berselli, Jan 31 2013
|
|
|
CROSSREFS
|
Cf. A000010, A000203, A020492, A023897.
Sequence in context: A114327 A073450 A071447 * A082490 A210635 A062242
Adjacent sequences: A063511 A063512 A063513 * A063515 A063516 A063517
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jul 31 2001
|
|
|
STATUS
|
approved
|
| |
|
|
