proposed
approved
proposed
approved
editing
proposed
with(numtheory): P:= proc(q) local a, b, c, j, k, n;
proposed
editing
editing
proposed
with(numtheory): P:= proc(q) local a, b, c, j, k, n; for n from 1 to q do a:=sort([op(divisors(n))]); c:=sigma(n)-2*n;
for n from 1 to q do a:=sort([op(divisors(n))]);
for k from 1 to n do if type(c/k, integer) then b:=0; for j from 1 to nops(a)-1 do b:=b+(a[j] mod k); od;
b:=b+(a[j] mod k); od; if b=n then print(n); break; fi; fi; od; od; end: P(10^5);
approved
editing
proposed
approved
editing
proposed
Paolo P. Lava, <a href="/A273124/a273124_1.txt">First 50 100 terms with 3 different values for of k >= 3</a>
proposed
editing
editing
proposed
with(numtheory): P:= proc(q) local a, b, c, j, k, n; for n from 1 to q do a:=sort([op(divisors(n))]); c:=sigma(n)-2*n;
for k from 1 to n do if type(c/k, integer) then b:=0; for j from 1 to nops(a)-1 do b:=b+(a[j] mod k); od;
if b=n then print(n); break; fi; fi; od; od; end: P(10^5);
proposed
editing