

A308627


Numbers k such that the ternary tribonacci sequence (A080843) has a Lyndon factor of length k.


0



1, 2, 3, 4, 5, 6, 7, 9, 11, 13, 16, 18, 20, 22, 24, 29, 31, 35, 37, 40, 42, 44, 53, 55, 57, 64, 66, 68, 77, 79, 81, 97, 99, 101, 110, 112, 121, 123, 125, 134, 136, 145, 147, 149, 178, 180, 189, 191, 193, 215, 217, 226, 228, 230, 246, 248, 250, 259, 261, 270
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

A "factor" is a contiguous subblock. A factor is "Lyndon" if it is lexicographically least among all its cyclic shifts.


LINKS

Table of n, a(n) for n=1..60.
Hamoon Mousavi and Jeffrey Shallit, Mechanical Proofs of Properties of the Tribonacci Word, arXiv:1407.5841 [cs.FL], 2014.
H. Mousavi and J. Shallit, Mechanical Proofs of Properties of the Tribonacci Word, In: Manea F., Nowotka D. (eds) Combinatorics on Words. WORDS 2015. Lecture Notes in Computer Science, vol 9304. Springer, 2015, pp. 170190.


CROSSREFS

Cf. A080843.
Sequence in context: A347327 A026445 A279078 * A330500 A030151 A307360
Adjacent sequences: A308624 A308625 A308626 * A308628 A308629 A308630


KEYWORD

nonn


AUTHOR

Jeffrey Shallit, Jun 11 2019


STATUS

approved



