A374145 Number of length-n binary words whose subword complexity is bounded by 2i for 1<=i<=n, and containing no blocks of exponent > 5/2.

1, 2, 4, 6, 10, 16, 24, 36, 50, 72, 102, 142, 194, 240, 298, 362, 434, 504, 528, 570, 624, 668, 712, 738, 778, 806, 810, 844, 836, 800, 806, 826, 844, 834, 844, 848, 812, 828, 864, 900, 916, 912, 900, 822, 786, 766, 736, 740, 766, 776, 780, 788, 808, 836, 864

Offset

0,2

Comments

The exponent of a word is defined to be its length divided by its shortest period. For example, "alfalfa" has exponent 7/3. Subword complexity is the number of distinct length-n blocks.

Links

Table of n, a(n) for n=0..54.

Nicolas Ollinger and Jeffrey Shallit, The repetition threshold for Rote sequences, Arxiv preprint arXiv:2406.17867 [math.CO], June 25 2024.

Crossrefs

Cf. A285894.

Sequence in context: A332281 A241903 A261204 * A293422 A132002 A098151

Adjacent sequences: A374142 A374143 A374144 * A374146 A374147 A374148

Keyword

nonn

Author

Jeffrey Shallit, Jun 28 2024

Status

approved