login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A215328 Smooth Lyndon words with 3 colors. 5
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 (list; graph; refs; listen; history; text; internal format)
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.

LINKS

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

EXAMPLE

(See A215327).

CROSSREFS

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

Sequence in context: A274761 A100885 A209199 * A107298 A195104 A257905

Adjacent sequences:  A215325 A215326 A215327 * A215329 A215330 A215331

KEYWORD

nonn,more

AUTHOR

Joerg Arndt, Aug 08 2012

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified November 23 19:00 EST 2017. Contains 295128 sequences.