cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

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.

Original entry on oeis.org

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

Views

Author

Jeffrey Shallit, Jun 28 2024

Keywords

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

Crossrefs

Cf. A285894.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.