Erdős's conjecture on backward consecutive integers

Let $\omega(n)$ denote the number of distinct prime factors of $n$. Erdős's conjecture. There are infinitely many $n$ such that

$$\omega(n-k)\leq k$$

for all integers $1\leq k<n$. This is Erdős Problem #413. The source gives no resolution, so the conjecture remains open.