OFFSET
1,6
COMMENTS
Previous name was: Sum of the remainders when n is divided by unrelated numbers (numbers which are neither coprime to n nor divide n).
LINKS
Paolo P. Lava, Table of n, a(n) for n = 1..1000
EXAMPLE
a(18) = 27: the unrelated numbers to 18 are 4, 8, 10, 12, 14, 15 and 16. The remainders when 18 is divided by these numbers are 2, 2, 8, 6, 4, 3 and 2 whose sum is 27.
MAPLE
seq(add(n mod k, k=select(j->gcd(j, n)>1, [$1..n])), n=1..69); # Peter Luschny, Oct 01 2014
MATHEMATICA
snmk[n_]:=Total[Mod[n, Complement[Complement[Range[n], Divisors[n]], Select[ Range[n], CoprimeQ[ #, n]&]]]]; Array[snmk, 70] (* Harvey P. Dale, Dec 09 2018 *)
PROG
(PARI) lista(nn) = vector(nn, n, sum(i=1, n, (n % i)*(gcd(n, i) != 1))); \\ Michel Marcus, Oct 01 2014
CROSSREFS
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Jul 30 2002
EXTENSIONS
Corrected and extended by David Garber, Oct 22 2002
New name from Robert Israel, Oct 01 2014
STATUS
approved