Fibonacci Cycles and Fixed Points

Let $S_b(n)$ denote the sum of the squares of the digits of the positive integer $n$ in base $b\ge 2$. It is well-known that the sequence of iterates of $S_b(n)$ terminates in a fixed point or enters a cycle. Let $N=2n-1$, $n\ge 2$. It is shown that if $b=F_{N+1}$, then a cycle of $S_b$ exists with initial term $F_N=F_0\mathrm{.}{F}_N$, and terminal element $F_n\mathrm{.}{F}_{n-1}$ if $n$ is even, or terminal element $F_{n-1}\mathrm{.}{F}_n$ if $n$ is odd. Similarly, Let $N=2n+1$, $n\ge 1$. If $b=F_{N-1}$, then a cycle of $S_b$ exists with initial term $F_N=F_2\mathrm{.}{F}_{N-2}$, and terminal element $F_n\mathrm{.}{F}_{n+1}$ if $n$ is even, or terminal element $F_{n+1}\mathrm{.}{F}_n$ if $n$ is odd. Furthermore, the cycles also admit extension as an arithmetic sequence of cycles of $S_b$ with base $b=F_{N+1}+F_{N+2}k$ and $b=F_{N-1}+F_{N-2}k$, respectively. Some fixed points of $S_b$ with $b$ a Fibonacci base are shown to exist. Lastly, both cycles and fixed points admit further generalization to Pell polynomials.