More properties of the Fibonacci word on an infinite alphabet (Q2330118)

The Fibonacci word on an infinite alphabet is a fixed point of the morphism \(\phi\): \((2i)\mapsto(2i)(2i+1)\), \((2i+1)\mapsto (2i+2)\) over all \(i\in\mathbb{N}\). Assume \(W_i=\phi^i(0)\) and let \(N(i,n)=|W_i|_n\) be the number of occurrences of \(n\) in \(W_i\). Then \[ N(i,n)=\binom{i-n+\lfloor \frac{n}{2}\rfloor}{\lfloor\frac{n}{2}\rfloor}. \] The total number of palindromes in \(W_i\), including single-letter palindromes, is 1, 2, 3, 6 for \(i =0, 1, 2, 3\) respectively, and \(f_{i+3}-2f_{i-2}\) for \(i >3\) (\(f_i\) is the \(i\)-th Fibonacci number). The number of distinct palindromes in \(W_i\) is 1, 2, 3, 5 for \(i=0, 1, 2, 3\) respectively and \(\lfloor\frac{5i}{2}\rfloor-2\) for \(i>3\). The total number of squares in \(W_i\) is \(f_i-1\). The number of distinct squares in \(W_i\) is \(\lfloor\frac{i-1}{2}\rfloor \lceil\frac{i-1}{2}\rceil\). Also all words \(W_k\) are Lyndon words and the number of their Lyndon factors is computed.