For each integer k2k \geqslant 2, determine all infinite sequences of positive integers a1,a2,a_1, a_2, \ldots for which there exists a polynomial PP of the form P(x)=xk+ck1xk1++c1x+c0P(x) = x^k + c_{k-1}x^{k-1} + \cdots + c_1x + c_0, where c0,c1,,ck1c_0, c_1, \ldots, c_{k-1} are non-negative integers, such that

P(an)=an+1an+2an+kP(a_n) = a_{n+1}a_{n+2}\cdots a_{n+k}

for every integer n1n \geqslant 1.