[seqfan] Re: Products of primorials

[franktaw at netscape.net]

I  have submitted a reasonably efficient PARI program to A025487.

Franklin T. Adams-Watters

-----Original Message-----
From: Charles Greathouse <charles.greathouse at case.edu>

There are many sequences which are naturally subsequences of A025487,
numbers with prime exponents in nonincreasing order (and no missing
primes).  Is there a good way to iterate through these numbers (not
necessarily in order) up to a fixed limit?  Alternately, a version
that iterated them in order in an unbounded fashion would be
interesting (but probably would not be as fast).

Any thoughts?  I'm sure this has been done already...