The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A332605 List of inequivalent extremal ternary words of length n over the alphabet {1,2,3}. 1
 1231213231232123121323123, 12132123132131232132312132123132131232132, 13213123213231213212313213123213231213212, 121323123213121323123212313231232131213231232131, 12132312132123132131232123132312132123132131232131, 121321231321312132313213123213231213212313213121323132131232132, 123121323123212313231232131231321231213231232123132312321312313 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Grytczuk et al. (2020) show that this sequence is infinite, and found the shortest such word, a(1). The other words shown here were found by Jeffrey Shallit (see A309623). LINKS Table of n, a(n) for n=1..7. Jaroslaw Grytczuk, Hubert Kordulewski, Artur Niewiadomski, Extremal Square-Free Words, Electronic J. Combinatorics, 27 (1), 2020, #1.48. CROSSREFS The distinct lengths of these words are given in A309623. Sequence in context: A217422 A328860 A095442 * A130682 A104304 A104322 Adjacent sequences: A332602 A332603 A332604 * A332606 A332607 A332608 KEYWORD nonn AUTHOR N. J. A. Sloane, Mar 07 2020 EXTENSIONS a(6)-a(7) from Michael S. Branicky, May 06 2022 STATUS approved

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.

Last modified May 29 22:36 EDT 2024. Contains 372954 sequences. (Running on oeis4.)