login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A308627 Numbers k such that the ternary tribonacci sequence (A080843) has a Lyndon factor of length k. 0

%I #13 Jul 21 2021 00:42:42

%S 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,

%T 64,66,68,77,79,81,97,99,101,110,112,121,123,125,134,136,145,147,149,

%U 178,180,189,191,193,215,217,226,228,230,246,248,250,259,261,270

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

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

%H Hamoon Mousavi and Jeffrey Shallit, <a href="https://arxiv.org/abs/1407.5841">Mechanical Proofs of Properties of the Tribonacci Word</a>, arXiv:1407.5841 [cs.FL], 2014.

%H H. Mousavi and J. Shallit, <a href="https://doi.org/10.1007/978-3-319-23660-5_15">Mechanical Proofs of Properties of the Tribonacci Word</a>, In: Manea F., Nowotka D. (eds) Combinatorics on Words. WORDS 2015. Lecture Notes in Computer Science, vol 9304. Springer, 2015, pp. 170-190.

%Y Cf. A080843.

%K nonn

%O 1,2

%A _Jeffrey Shallit_, Jun 11 2019

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 19:39 EDT 2024. Contains 371963 sequences. (Running on oeis4.)