|
|
A212659
|
|
Good's example of a "Standard List" of prime words over the alphabet {1,2}.
|
|
2
|
|
|
1, 2, 12, 112, 212, 1112, 2212, 2112, 11112, 21112, 12112, 22112, 12212, 22212, 111112, 211112, 121112, 221112, 122112, 222112, 112212, 122212, 222212, 1111112, 2111112, 1211112, 2211112, 1121112
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This is just one possible ordering of the list, given by Good in his Table 1. There are A001037(n) words of length n in the list, and they can be arranged in A001037(n)! ways. However, changing the order would also change the individual entries.
This sequence is well-defined only in the sense that it is in the order chosen by Good, who gives the 71 words of length <= 8. The sequence must be regarded as being undefined beyond that point.
For the rules that the list must satisfy, see pages 28-31 of Good.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|