login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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:
R; # Robert Israel, Jan 09 2024
CROSSREFS
Sequence in context: A325283 A167706 A331091 * A349179 A175305 A342702
KEYWORD
nonn
AUTHOR
Vladeta Jovovic, Jun 19 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)