MEMO 2020 I1

Let $\mathbb{N}$ be the set of positive integers. Determine all positive integers $k$ for which there exist functions $f: \mathbb{N} \rightarrow \mathbb{N}$ and $g: \mathbb{N} \rightarrow \mathbb{N}$ such that $g$ assumes infinitely many values and such that

$$f^{g(n)}(n) = f(n) + k$$

holds for every positive integer $n$.

(Remark. Here, $f^i$ denotes the function $f$ applied $i$ times, i.e., $f^i(j) = \underbrace{f(f(\ldots f(f(j)) \ldots))}_{i \text{ times}}$).