login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Smallest m such that prime(3*n)# can be written as a product of n sphenic numbers each <= m.
0

%I #12 Sep 25 2020 00:01:59

%S 30,182,627,1705,3741,7285,13039,21889,33611,51389,74497,104081,

%T 140491,188641,246089,312547,394831,491713,604283,736189,886937,

%U 1058581,1249331,1474531

%N Smallest m such that prime(3*n)# can be written as a product of n sphenic numbers each <= m.

%C a(n) >= ceiling((prime(3*n)#)^(1/n)). - _Chai Wah Wu_, Sep 24 2020

%e a(4) = 1705.

%e p(3*4)#, which is the product of the first 12 primes, can be written as

%e s1 * s2 * s3 * s4 with

%e s1 = 5 * 11 * 31 = 1705,

%e s2 = 2 * 23 * 37 = 1702,

%e s3 = 3 * 19 * 29 = 1653,

%e s4 = 7 * 13 * 17 = 1547.

%e No such factorization is possible in sphenic numbers that are all < 1705.

%Y Cf. A002110, A007304.

%K nonn,more

%O 1,1

%A _Bert Dobbelaere_, Aug 29 2020