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(NumberTheory):
 
countDivisors := proc(x::integer)
 return numelems(Divisors(x));
end proc:
 
sequenceValue := proc(x::integer)
 local count:
 for count from 1 to infinity while not countDivisors(count) = x do end:
 return count;
end proc:
 
seq(sequenceValue(number), number = 1..15);
 
 