Hofstadter's G function is recursively defined via G(0) = 0 and then G(n) = n – G(G(n – 1)). Following Hofstadter, we vary the number k of nested recursive calls in this equation and obtain a family of functions (F_k). Here we establish that this family is ordered pointwise: for all k and n, we have F_k(n) ≤ F_k+1(n). To achieve this, we make a detour via infinite morphic words generalizing the Fibonacci word. We prove various properties of these words, concerning the lengths of substituted prefixes of these words and the number of occurrences of specific letters in these prefixes. We also relate the limits of (1/n)F_k(n) to the frequencies of letters in the considered words. We provide a certified formalization of all these results in the Rocq proof assistant.