OFFSET
0,2
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.
EXAMPLE
(See A215327).
CROSSREFS
KEYWORD
nonn
AUTHOR
Joerg Arndt, Aug 08 2012
EXTENSIONS
More terms from Joerg Arndt, Jun 17 2019
STATUS
approved