31111

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=37A030283
• Numbers whose set of base-13 digits is {1,2}.at n=35A032933
• Numbers with multiplicative digital root value 3.at n=14A034050
• Numbers n such that sum of digits and product of digits are both prime.at n=24A052430
• Decimal encoding of the prime factorization of n: concatenation of prime factors and exponents.at n=31A067599
• a(1) = 11 by convention; for n > 1, if n = p^a*q^b... then a(n) = concatenate(p,a,q,b,...).at n=32A068633
• Digitized partition numbers: numbers with (weakly) decreasing digits ordered by sum of their digits then by the numbers themselves.at n=42A068743
• Lunar fourth powers: n*n*n*n, where * is lunar multiplication.at n=31A087051
• Lexicographically earliest increasing sequence of composite numbers such that the digits of a(n) do not appear in a(n-1).at n=31A100373
• a(n) = Sum_{k=1..n} floor(binomial(n,k)/k).at n=18A101687
• Near-repunit semiprimes.at n=34A105993
• Zero-free numbers with digit sum equal to 7.at n=56A119461
• First digit of a(n) is the a(n)-th digit of S [a(n+1) is the smallest available integer not yet present in S, subject to S being monotonically increasing].at n=21A126969
• Numbers which are the sum of the squares of seven consecutive primes.at n=15A133562
• Lexicographically earliest increasing sequence of numbers with all odd digits alternating with numbers with all even digits.at n=34A180412
• Composite numbers with digital product = 3.at n=5A199982
• Number of (w,x,y,z) with all terms in {1,...,n} and 3w<x+y+z+n.at n=14A212249
• List of primitive words over the alphabet {1,3}.at n=37A213970
• Composite numbers for which both sum and product of digits are primes.at n=10A225864
• Number of n X 2 0..6 arrays of the sum of the corresponding element, the element to the east and the element to the south in a larger (n+1) X 3 0..2 array.at n=2A229432