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


using Primes
 
numfactors(n) = reduce(*, e+1 for (_,e) in factor(n); init=1)
 
A005179(n) = findfirst(k -> numfactors(k) == n, 1:typemax(Int))
 
println("The first 15 terms of the sequence are:")
println(map(A005179, 1:15))
 