This question Method for coming up with consecutive integers not relatively prime to $(100!)$
asks, how many consecutive numbers can have a prime factor below $100$
In general, let $d(p)$ be the maximum possible number of consecutive numbers that have a prime factor not exceeding $p$. A link to OEIS with the optimal values for small numbers $p$ is given, but I did not find a concrete method.
How can I calculate $d(p)$ for a given prime $p$ ?
My only idea is that the number of numbers out of $k$ numbers having a prime factor not exceeding $p$ can be bounded from above by $$\left\lceil \frac{k}{2}\right\rceil+\left\lceil \frac{k}{2\cdot 3}\right\rceil+ \left\lceil \frac{k}{2\cdot 5} \right\rceil +\cdots+\left\lceil\frac{k}{2p}\right\rceil$$ This approach allows to get a rough upper bound, but it seems to be difficult to calculate the exact value in general.
Any ideas ?