Consider the recurrence
xn+1=c+r(xn−c)r+λ,
where r≥1 is an odd integer, c,λ∈R, and x1∈R.
Then, for every n≥1,
xn=c+r(x1−c)r+(n−1)λ.
In particular, assume that λ>0 and x1≤M. Then the largest positive integer n satisfying
xn≤M
is
nmax=1+⌊λ(M−c)r−(x1−c)r⌋.
More generally, let Φ:I→J be a bijection and suppose that
xn+1=Φ−1(Φ(xn)+λ),
whenever the right-hand side is defined.
Then
xn=Φ−1(Φ(x1)+(n−1)λ).
Indeed, the recurrence is transformed by Φ into the arithmetic progression
Φ(xn+1)=Φ(xn)+λ.
Therefore the nonlinear recurrence is conjugate to the translation
t↦t+λ.