Školjka

%V0 Let $k$ be a positive integer. Show that if there exists a sequence $a_0$, $a_1$, ... of integers satisfying the condition $$a_n=\frac{a_{n-1}+n^k}{n} \text{,} \qquad \forall n \geqslant 1 \text{,}$$ then $k-2$ is divisible by $3$. Proposed by Turkey