A194942 List of seven normalized ternary Abelian squarefree words.

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,9

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.

Links

Table of n, a(n) for n=1..97.

V. Keränen, New Abelian Square-Free DT0L-Languages over 4 Letters

Example

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).

Sequence in context: A091603 A370884 A325036 * A129688 A356678 A356680

Adjacent sequences: A194939 A194940 A194941 * A194943 A194944 A194945

Keyword

nonn,fini,full,tabf

Author

Franklin T. Adams-Watters, Sep 05 2011

Status

approved