[seqfan] Re: Products of primorials

franktaw at netscape.net franktaw at netscape.net
Thu Dec 1 09:09:41 CET 2011

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...


More information about the SeqFan mailing list