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


 
load "stdlib.ring"
 
see "working..." + nl
see "the first 15 terms of the sequence are:" + nl
 
for n = 1 to 15
    for m = 1 to 4100
        pnum = 0
        for p = 1 to 4100
            if (m % p = 0)
               pnum = pnum + 1
            ok
        next
        if pnum = n
           see "" + m + " "
           exit  
        ok
     next
next
 
see nl + "done..." + nl
 