Create the shortest function, program, or expression that calculates A073329, i.e.,
a(n) is the nth number having n distinct prime factors. Input is the number of elements in the sequence to return.
0 < n. I am unconcerned with integer precision. I just want the algorithm. For languages that don't support arbitrarily large integers, we'll just pretend they do.
You can find test cases by following the link to OEIS given above.
Let me make it clear that you need to return an integer sequence from your program, function, or expression. In other words,
f(x) should calculate
a(n) for all
n from 1 to
x of 8, your function should return
2, 10, 60, 420, 4290, 53130, 903210, 17687670 as an array or some other appropriate data structure.