71111

Appears in sequences

• 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=41A030283
• Numbers with multiplicative digital root value 7.at n=14A034054
• Numbers n such that sum of digits and product of digits are both prime.at n=25A052430
• Concatenate consecutive prime-sided isosceles triangles.at n=3A097446
• Lexicographically earliest increasing sequence of composite numbers such that the digits of a(n) do not appear in a(n-1).at n=35A100373
• 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=26A152136
• 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=25A152607
• Lexicographically earliest increasing sequence of numbers with all odd digits alternating with numbers with all even digits.at n=38A180412
• Composite numbers whose multiplicative digital root is 7.at n=7A201021
• Composite numbers for which both sum and product of digits are primes.at n=11A225864
• Number of nonzero coefficients in the polynomial factor of the expression counting binomial coefficients with 2-adic valuation n.at n=13A275012
• Largest positive number using exactly n segments on a calculator display (when '6' and '7' are represented using 6 resp. 3 segments).at n=9A337099
• a(n) is the smallest proper multiple of n whose digit product is the same as the digit product of n; 0 if no such number exists.at n=16A340204