cp's OEIS Frontend

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.

A194942 List of seven normalized ternary Abelian squarefree words.

Original entry on oeis.org

0, 0, 1, 0, 1, 0, 0, 1, 2, 0, 1, 0, 2, 0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 0, 2, 0, 0, 1, 0, 2, 1, 0, 1, 2, 0, 1, 0, 1, 2, 0, 2, 0, 1, 2, 1, 0, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 1, 0, 0, 1, 0, 2, 1, 2, 0, 1, 2, 0, 1, 0, 0, 1, 2, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 0, 1, 0, 2, 1, 0, 1, 0, 1, 2, 1, 0, 1, 2
Offset: 1

Views

Author

Keywords

Comments

Lexicographically ordered list of words of increasing length L=1,2,3,... over the alphabet {0,1,2}, without those which contain two adjacent subsequences with the same multiset of symbols, regardless of internal order. Only those words where the symbols appear in order are included; e.g., {0, 1, 0, 2}, but not {0, 2, 0, 1} or {1, 2, 1, 0}.
The row lengths in number of sequences are 1, 1, 2, 3, 5, 5, 3, for total row lengths of 1, 2, 6, 12, 25, 30, 21.

Examples

			The rows are:
{{0}},
{{0, 1}},
{{0, 1, 0}, {0, 1, 2}},
{{0, 1, 0, 2}, {0, 1, 2, 0}, {0, 1, 2, 1}},
{{0, 1, 0, 2, 0}, {0, 1, 0, 2, 1}, {0, 1, 2, 0, 1}, {0, 1, 2, 0, 2}, {0, 1, 2, 1, 0}},
{{0, 1, 0, 2, 0, 1}, {0, 1, 0, 2, 1, 0}, {0, 1, 0, 2, 1, 2}, {0, 1, 2, 0, 1, 0}, {0, 1, 2, 1, 0, 1}},
{{0, 1, 0, 2, 0, 1, 0}, {0, 1, 0, 2, 1, 0, 1}, {0, 1, 2, 1, 0, 1, 2}}
		

Crossrefs

Cf. A194923 (includes non-normalized sequences).