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


func Divisors(N); \Return number of divisors of N
int  N, Count, D;
[Count:= 0;
for D:= 1 to N do
    if rem(N/D) = 0 then Count:= Count+1;
return Count;
];
 
int N, AN;
[for N:= 1 to 15 do
    [AN:= 0;
    repeat AN:= AN+1 until Divisors(AN) = N;
    IntOut(0, AN);  ChOut(0, ^ );
    ];
]