1111121

Appears in sequences

• Leftmost 1 is converted to a 2, which then propagates one step at a time until it is rightmost; then it changes to a pair of 1's and the process repeats.at n=34A071762
• a(1) = 1, then the smallest number not included earlier and not a string of 1's such that the concatenation a(n), a(n+1) is a palindrome.at n=17A083122
• Numbers n that are divisible by d, where a_i for 1 <= i <= k are the digits of n and d = Product_{i=1..k}Sum_of_digits_of_(a_i^k).at n=32A128870
• a(n) is the smallest integer that contains a(n-1) but does not begin with a(n-1).at n=6A179956
• Numbers with digital product = 2.at n=22A199986
• Composite numbers whose product of digits is 2.at n=16A201015
• To concatenate all terms, to concatenate the odd rank terms or to concatenate the even rank terms produces the same result.at n=24A299823
• Unique representation of nonnegative numbers by iterated tribonacci A, B and C sequences.at n=24A316713
• Positive integers m such that m * (m+1) contains at least 8 decimal digits that are in neither m nor m+1.at n=9A381247