111222

Appears in sequences

• Fibonacci numbers written in base 3.at n=14A004686
• List of strings in lexicographic order with property that for the 2^(m-1) strings of length m, the first entry is 1, the second distinct entry (reading from left to right) is 2, the third distinct entry is 3, etc.at n=35A096299
• List of Lyndon words on {1,2} sorted first by length and then lexicographically.at n=17A102659
• Numbers which are sum of distinct unary numbers (containing only ones), i.e., numbers which are sum of distinct numbers of the form (10^k - 1)/9.at n=35A110382
• Sorted list of strings that can be obtained by starting with 12 and repeatedly doubling any substring in place.at n=18A130838
• 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=7A171725
• a(n) = (1/9)*(10^(2*n) + 10^n - 2).at n=3A181718
• Number of nX2 0..4 arrays with every row and column running average nondecreasing rightwards and downwards.at n=5A200852
• Number of nX6 0..4 arrays with every row and column running average nondecreasing rightwards and downwards.at n=1A200856
• T(n,k)=Number of nXk 0..4 arrays with every row and column running average nondecreasing rightwards and downwards.at n=22A200858
• T(n,k)=Number of nXk 0..4 arrays with every row and column running average nondecreasing rightwards and downwards.at n=26A200858
• 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=71A211096
• 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=69A211099
• List of words over {1,2} with equal numbers of 1's and 2's.at n=8A214218
• List of minimal palindromic words over {1,2} that begin with 1, and have lengths 1, 2, 3, ....at n=9A225189
• Minimal representation (considered minimal in any canonical base b >= 3) of n in a binary system using two distinct digits "1" and "2", not allowing zeros, where a digit d in position p (p = 1,2,3,...,n) represents the value d^p.at n=16A235860
• List of prefix-normal words over the alphabet {1,2}.at n=39A238109
• a(n) = arrange digits of concatenation of divisors of n (A037278, A176558) in increasing order in base 10 (zero digits are omitted).at n=21A243361
• List of ternary words obtained by expanding (1+2x)^n mod 3 and reading the coefficients starting with the constant term.at n=5A253091
• 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=21A273978