Erdős problem 389

Is it true that for every $n \geq 1$ there is a $k$ such that $$n(n + 1) \cdots (n + k - 1) \mid (n + k) \cdots (n + 2k - 1)?$$