Calculate the sequence where each term   an   is the smallest natural number that has exactly   n   divisors.



Task
Show here, on this page, at least the first  15  terms of the sequence.



Related tasks

 Sequence: smallest number greater than previous term with exactly n divisors
 Sequence: nth number with exactly n divisors‎‎


See also

 OEIS:A005179


with javascript_semantics 
constant limit = 15
sequence res = repeat(0,limit)
integer found = 0, n = 1
while found<limit do
    integer k = length(factors(n,1))
    if k<=limit and res[k]=0 then
        res[k] = n
        found += 1
    end if
    n += 1
end while
printf(1,"The first %d terms are: %V\n",{limit,res})
