OFFSET
1,1
COMMENTS
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
MAPLE
f:= proc(n) local t, k;
t:= 2*numtheory:-tau(n);
for k from 2*n by n do
if numtheory:-tau(k) >= t then return k fi
od
end proc:
map(f, [$1..100]); # Robert Israel, Jan 20 2022
MATHEMATICA
a[n_] := Module[{d = 2 * DivisorSigma[0, n], k = 2*n}, While[DivisorSigma[0, k] < d, k += n]; k]; Array[a, 100] (* Amiram Eldar, Jan 08 2022 *)
PROG
(PARI) a(n) = my(m=n, d=numdiv(n)); while(numdiv(m)<2*d, m+=n); m; \\ Michel Marcus, Jan 08 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
J. Lowell, Jan 08 2022
STATUS
approved