122222

Appears in sequences

• Numbers k such that rotating digits of k^2 left once still yields a square.at n=21A045878
• Number of nodes on a tree with degree 11 interior nodes and degree 1 boundary nodes.at n=5A090843
• Expansion of g.f. x*(1+11*x+x^2)/((1-x)*(1+x)*(1-10*x^2)).at n=11A094624
• Expansion of x*(1+x)/((1-x)*(1-10*x^2)).at n=11A094626
• List of Lyndon words on {1,2} sorted first by length and then lexicographically.at n=22A102659
• Base 3 representation of the positive integers n such that Sum[d[k],k=1..n] is an integer, where d(k) is the base 3 fraction 0.k (e.g., d(22 base 10)=d(211 base 3)=0.221 base 3).at n=7A107483
• Sorted list of strings that can be obtained by starting with 12 and repeatedly doubling any substring in place.at n=30A130838
• List of pairs (n,m) with n < m such that the decimal expansion of m is a cyclic shift of that of n and m^2 is a cyclic shift of n^2.at n=10A134514
• First elements of the pairs listed in A134514.at n=5A134584
• Generalized Lucas-Pascal triangle; (11*10^n, 1).at n=22A164851
• Numbers with n digits from the set {1,2,4}, requiring a nondecreasing sequence of digits and a digits sum of A008578(n).at n=5A166747
• Triangle read by rows in which row n lists the binary words of length n over the alphabet {1,2} with no initial repeats.at n=35A211029
• a(n) is the least multiple of n which uses only digits 1 and 2. a(n) = -1 if no such multiple exists.at n=45A216478
• Reversed shortest (x+1,2x)-code of n.at n=32A233137
• Let f(m) put the leftmost digit of the positive integer m at its end; a(n) is the sequence of all positive integers m with f^2(m)=f(m^2).at n=7A245584
• To concatenate all terms, to concatenate the odd rank terms or to concatenate the even rank terms produces the same result.at n=27A299823
• Record high values in A358497.at n=24A358615