1112111

Appears in sequences

• Composite palindromes divisible by the sum of their prime factors (counted with multiplicity).at n=27A046348
• n sets a new record for the number of integers k such that k is not of the form m + reverse(m) for any m and n occurs in the 'Reverse and Add' trajectory of k (cf. A067284).at n=34A067287
• 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=32A071762
• In the array shown below the n-th row contains all the palindromes that use digits > 0 and have a digit sum of n. The sequence contains the array read by rows.at n=43A082266
• Numbers n such that the set S(n) = {k: k + reverse(k) = n} is not empty, at least one element of S(n) has the same number of digits as n and at least one element of S(n) has one digit less than n has.at n=7A088171
• Palindromes for which the product of the digits is prime.at n=12A117058
• 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=33A128870
• Numbers with digital product = 2.at n=24A199986
• Composite numbers whose product of digits is 2.at n=17A201015
• Zeroless numbers n such that n and n*product_of_digits(n) are both palindromes.at n=25A229804
• List of privileged words over the alphabet {1,2}.at n=29A235609
• a(0) = 1; thereafter a(n) is the concatenation of a(n-1), n, a(n-1).at n=2A259747
• Terms in A083115 that are the smallest members of equivalence classes generated by permutation of digits.at n=38A266280
• a(n) = (10^(2n+1)-1)/9 + 10^n.at n=3A332112