Infinitely Many Binomial Coefficients of Deficiency One

A binomial coefficient $\binom{n}{k}$ is good if all its prime divisors exceed $k$, and its deficiency is the number of $k$-smooth integers in $(n-k,n]$. A short constructive proof of the existence of infinitely many good binomial coefficients with deficiency exactly one is given, which provides an