111113

Appears in sequences

• Numbers with multiplicative digital root value 3.at n=15A034050
• a(n) = (10^n + 17)/9.at n=6A098406
• Primes of form R_n + 2 {= (10^n + 17)/9}, R_n being the n-th repunit, i.e., primes consisting of a string of 1's followed by a terminal 3.at n=4A105431
• Keep only the first digit of each integer and concatenate them. The result is the concatenation of all integers of the sequence.at n=30A106000
• a(n) is the least semiprime > a(n-1) whose digits do not appear in a(n-1).at n=34A131220
• a(0) = 0; thereafter a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that the concatenation of any two consecutive digits in the sequence is a prime.at n=32A152136
• a(1) = 1; thereafter a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that the concatenation of any two consecutive digits in the sequence is a prime.at n=31A152607
• Composite numbers with digital product = 3.at n=6A199982
• A two-digit Look-and-Say sequence starting with 13: each term summarizes the increasing two-digit substrings of the previous term.at n=2A221369
• Minimal representation (considered minimal in any canonical base b > 3) of n in a binary system with two distinct digits "1" and "3", not allowing zeros, where a digit d in position p (p = 1,2,3,...,n) represents the value d^p.at n=7A237454
• Consider the partition of the positive odd integers into minimal blocks such that concatenation of numbers in each block is an odious number (A000069). Sequence lists the odious numbers obtained in this way.at n=20A248477
• Lexicographically earliest sequence of distinct terms such that a(n) is divisible by five and only five digits of a(n+1).at n=13A308609