311111

Properties

Appears in sequences

• Primes that contain digits 1 and 3 only.at n=25A020451
• a(0) = 0; for n>0, a(n) is the smallest number greater than a(n-1) which does not use any digit used by a(n-1).at n=45A030283
• a(n) is the least prime > a(n-1) whose digits do not appear in a(n-1).at n=34A030284
• Numbers with multiplicative digital root value 3.at n=20A034050
• Multiplicative primes: product of digits is a prime.at n=28A046703
• a(n) is the smallest prime ending in exactly n 1's.at n=4A065821
• Primes with a 3 followed by 1's.at n=2A068813
• Primes of the form identical digits preceded by a 3.at n=4A090151
• Beginning with 11, the smallest prime not already used beginning with the number obtained by placing the most significant digit to the right of the least significant digit.at n=6A090227
• Near-repunit primes.at n=38A105992
• Keep only the first digit of each integer and concatenate them. The result is the concatenation of all integers of the sequence.at n=31A106000
• Primes with digital product = 3.at n=11A107689
• Prime numbers for which the product of the digits is a noncomposite number.at n=29A117835
• Chen primes for which the product of the digits is also a Chen prime.at n=19A118722
• Primes with at least one digit appearing exactly five times in the decimal expansion.at n=10A161796
• Lexicographically earliest increasing sequence of numbers with all odd digits alternating with numbers with all even digits.at n=42A180412
• Non-repunit elements of A261020 in nonincreasing order.at n=17A261322
• a(0)=a(1)=1; thereafter a(n) = (4*n-3)*a(n-1) + 2*a(n-2).at n=6A272646
• Irregular triangle read by rows: row n lists all of the distinct derivable strings in the MIU formal system that are n characters long.at n=41A369173
• Irregular triangle read by rows: row n lists the lines of a "normal" proof (see comments) for the MIU formal system string (theorem) given by A369173(n+1).at n=17A369409