This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A332605 #16 Jan 04 2025 13:48:08
%S A332605 1231213231232123121323123,12132123132131232132312132123132131232132,
%T A332605 13213123213231213212313213123213231213212,
%U A332605 121323123213121323123212313231232131213231232131,12132312132123132131232123132312132123132131232131,121321231321312132313213123213231213212313213121323132131232132,123121323123212313231232131231321231213231232123132312321312313
%N A332605 List of inequivalent extremal ternary words of length n over the alphabet {1,2,3}.
%C A332605 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 A332605 Jaroslaw Grytczuk, Hubert Kordulewski, and Artur Niewiadomski, <a href="https://doi.org/10.37236/9264">Extremal Square-Free Words</a>, Electronic J. Combinatorics, 27 (1), 2020, #1.48.
%Y A332605 The distinct lengths of these words are given in A309623.
%K A332605 nonn
%O A332605 1,1
%A A332605 _N. J. A. Sloane_, Mar 07 2020
%E A332605 a(6)-a(7) from _Michael S. Branicky_, May 06 2022