|
|
A143869
|
|
An integer k is called regular (mod n) if there is an integer x such that k^2 x == k (mod n). Then these numbers are the sum of regular integers k (mod n) such that 1 <= k <= n for n=1,2,... .
|
|
2
|
|
|
1, 3, 6, 8, 15, 21, 28, 24, 36, 55, 66, 60, 91, 105, 120, 80, 153, 135, 190, 160, 231, 253, 276, 192, 275, 351, 270, 308, 435, 465, 496, 288, 561, 595, 630, 396, 703, 741, 780, 520, 861, 903, 946, 748, 810, 1081, 1128, 672, 1078, 1075, 1326, 1040, 1431, 1053
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
PROG
|
(PARI) isregu(k, n) = {g = gcd(k, n); if ((n % g == 0) && (gcd(g, n/g) == 1), return(k), return(0)); }
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|