The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A338298 First difference of the subword complexity function of the Fibonacci-Thue-Morse sequence (A095076). 0
 1, 2, 4, 6, 10, 6, 6, 8, 6, 8, 8, 6, 6, 6, 6, 8, 8, 8, 6, 6, 6, 6, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6 (list; graph; refs; listen; history; text; internal format)
 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 Table of n, a(n) for n=0..85. 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 Cf. A095076. Sequence in context: A227526 A093081 A242521 * A366581 A073659 A073661 Adjacent sequences: A338295 A338296 A338297 * A338299 A338300 A338301 KEYWORD nonn AUTHOR Jeffrey Shallit, Oct 21 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 7 17:47 EDT 2024. Contains 375017 sequences. (Running on oeis4.)