112212

Appears in sequences

• List of Lyndon words on {1,2} sorted first by length and then lexicographically.at n=19A102659
• Sorted list of strings that can be obtained by starting with 12 and repeatedly doubling any substring in place.at n=21A130838
• 6-digit numbers k such that: (a) the digits of k are from the set {1, 2, 3, 4, 5}, and (b) any digit that appears in k appears at least twice.at n=21A171725
• Number of 3 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 1 vertically.at n=11A207590
• Smallest (i.e., rightmost) Lyndon word in the Lyndon factorization of the binary representation of n (written using 1's and 2's rather than 0's and 1's, since numbers > 0 in the OEIS cannot begin with 0).at n=77A211096
• Largest (i.e., leftmost) Lyndon word in Lyndon factorization of binary vectors of lengths 1, 2, 3, ... (written using 1's and 2's rather than 0's and 1's, since numbers > 0 in the OEIS cannot begin with 0).at n=75A211099
• Good's example of a "Standard List" of prime words over the alphabet {1,2}.at n=20A212659
• List of subwords (or factors) of the Thue-Morse "1,2"-word A001285.at n=36A214215
• List of words over {1,2} with equal numbers of 1's and 2's.at n=10A214218
• prime(n^3) - prime(n).at n=21A214612
• List of words of length n over an alphabet of size 9 that are in standard order and which have the property that every letter that appears in the word is repeated.at n=26A273978
• Take n-th string over {1,2} in lexicographic order and apply the Post tag system described in A284116 (but adapted to the alphabet {1,2}) just once.at n=46A289673
• Consider the Post tag system described in A284116 (but adapted to the alphabet {1,2}); sequence lists the words that belong to cycles.at n=1A289674
• a(1) = 1; a(2) = 2; for n > 2, a(n) is the least number > a(n-1) whose decimal representation is uniquely the concatenation of the decimal representations of two distinct earlier terms.at n=34A336528
• The word 1 belongs to the sequence, and whenever a word w belongs to the sequence, then the words consisting of 1's and 2's whose run lengths transform equals w also belong to the sequence.at n=24A376637
• List of subwords (or factors) of the Kolakoski sequence (A000002).at n=38A376677