|
|
A072121
|
|
a(1) = 1; for n > 1, a(n) = smallest number > a(n-1) having at least n divisors.
|
|
2
|
|
|
1, 2, 4, 6, 12, 18, 24, 30, 36, 48, 60, 72, 120, 144, 168, 180, 240, 252, 336, 360, 420, 480, 504, 540, 720, 840, 900, 960, 1008, 1080, 1260, 1320, 1440, 1680, 1800, 1980, 2160, 2520, 2640, 2880, 3360, 3600, 3780, 3960, 4200, 4320, 4620, 4680, 5040, 6300
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
MAPLE
|
f:= proc(n, a) local k;
for k from a+1 do
if numtheory:-tau(k) >= n then return k fi
od
end proc:
R:= 1: x:= 1:
for n from 2 to 100 do x:= f(n, x); R:= R, x od:
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|