Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 4500 articles have referenced us, often saying "we would not have discovered this result without the OEIS".
A056602
Numbers A such that there is an equation of the form (A = Product of m + 1 primes) = (B = Product of m primes) + (C = Product of m primes), where A*B*C is a primorial number (A002110).
Terms have been verified. There are no additional terms for m <= 7. - Rick L. Shepherd, Jun 16 2008
(C(3m+1,m+1)*C(2m,m))/(C(3m-2,m)*C(2m-2,m-1)) = (27m^2-1)/(m^2+1), so for a brute-force search for large m, about 27 times as many cases must be examined for m as for m-1. - Rick L. Shepherd, Jun 16 2008