%I #12 May 07 2022 09:42:32
%S 1231213231232123121323123,12132123132131232132312132123132131232132,
%T 13213123213231213212313213123213231213212,
%U 121323123213121323123212313231232131213231232131,12132312132123132131232123132312132123132131232131,121321231321312132313213123213231213212313213121323132131232132,123121323123212313231232131231321231213231232123132312321312313
%N List of inequivalent extremal ternary words of length n over the alphabet {1,2,3}.
%C 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).
%H Jaroslaw Grytczuk, Hubert Kordulewski, Artur Niewiadomski, <a href="https://www.combinatorics.org/ojs/index.php/eljc/article/view/v27i1p48">Extremal SquareFree Words</a>, Electronic J. Combinatorics, 27 (1), 2020, #1.48.
%Y The distinct lengths of these words are given in A309623.
%K nonn
%O 1,1
%A _N. J. A. Sloane_, Mar 07 2020
%E a(6)a(7) from _Michael S. Branicky_, May 06 2022
