login
A346986
Number of states in minimal deterministic finite automaton recognizing the set of binary Lyndon words of length n.
0
3, 4, 5, 7, 9, 12, 17, 23, 34, 47, 69, 95, 140, 195, 277, 399
OFFSET
1,1
COMMENTS
A word is Lyndon if it is (a) lexicographically <= all of its cyclic shifts and (b) not a power (a block repeated 2 or more times). For example, the binary Lyndon words of length 4 are 0001, 0011, and 0111.
CROSSREFS
Cf. A001037 (the number of binary Lyndon words of length n).
Sequence in context: A104805 A260996 A102822 * A167159 A226918 A227391
KEYWORD
nonn,more
AUTHOR
Jeffrey Shallit, Aug 09 2021
STATUS
approved