111221

Appears in sequences

• Describe the previous term (in base 3)!.at n=4A001388
• Look and Say sequence: describe the previous term! (method A - initial term is 1).at n=4A005150
• Composite numbers whose prime factors contain no digits other than 0 and 1.at n=6A036928
• Smallest composite number n such that every divisor > 1 includes n as a substring.at n=11A105582
• Modified Look-and-Say sequence where 2 is the largest number that may be used.at n=4A110393
• 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=6A171725
• Numbers with digital product = 4.at n=39A199987
• Composite numbers whose product of digits is 4.at n=32A201016
• Numbers whose largest digit of all divisors is 2.at n=38A221697
• Composite numbers n such that largest digit of all divisors of n is 2.at n=9A221698
• Elements of the Motzkin words sub-operad Motz of TN generated by 00 and 010.at n=20A231872
• List of prefix-normal words over the alphabet {1,2}.at n=38A238109
• Positive numbers n such that (digitsum(n))^2 equals (product of digits(n))^3.at n=8A261778
• 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=20A273978
• Look-and-Say sequence in base 3/2.at n=4A305660
• Unique representation of nonnegative numbers by iterated tribonacci A, B and C sequences.at n=31A316713
• Smallest number with a n-character traditional Japanese notation.at n=9A384792
• Numbers without a prime factor with a digit larger than 1.at n=11A385345