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



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



See also
 OEIS:A069654


Related tasks
 Sequence: smallest number with exactly n divisors
 Sequence: nth number with exactly n divisors‎‎


func n_divisors(n, from=1) {
    from..Inf -> first_by { .sigma0 == n }
}
 
with (1) { |from|
    say 15.of { from = n_divisors(_+1, from) }
}