OFFSET
0,2
COMMENTS
The subword complexity function of a sequence is the number of distinct blocks of length n occurring in the sequence.
LINKS
Michel Dekking, The structure of Zeckendorf representations and base phi expansions, talk for the One World Seminar on Combinatorics on Words, October 19 2020.
Jeffrey Shallit, Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking’s conjecture, arXiv:2010.10956 [cs.DM], 2020.
FORMULA
For all n >= 7, the sequence takes only the values 6 and 8, in longer and longer intervals that are of length a Fibonacci number, or a Fibonacci number +- 1. For the exact statement, see the paper of Shallit.
CROSSREFS
KEYWORD
nonn
AUTHOR
Jeffrey Shallit, Oct 21 2020
STATUS
approved