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.

A215328 Smooth Lyndon words with 3 colors.

Original entry on oeis.org

1, 3, 2, 5, 10, 24, 49, 112, 240, 534, 1175, 2626, 5848, 13153, 29594, 66955, 151814, 345494, 788049, 1802675, 4132469, 9495242, 21859912, 50423465, 116511119, 269666586, 625101288, 1451128164, 3373250909, 7851415835
Offset: 0

Views

Author

Joerg Arndt, Aug 08 2012

Keywords

Comments

We call a Lyndon word (x[1],x[2],...,x[n]) smooth if abs(x[k]-x[k-1]) <= 1 for 2<=k<=n.
All binary Lyndon words (2 colors, A001037) are necessarily smooth.

Examples

			(See A215327).
		

Crossrefs

Cf. A027376 (Lyndon words, 3 colors), A215327 (smooth necklaces, 3 colors).

Extensions

More terms from Joerg Arndt, Jun 17 2019