100021

Appears in sequences

• Lexicographically earliest strictly increasing decimal autovarious sequence: a(n) = number of distinct n-digit endings (left-zero-padded) of terms in the sequence.at n=26A037089
• Lexicographically earliest strictly increasing base 4 autovarious sequence: a(n) = number of distinct a(k) mod 4^n (written in base 4).at n=21A038113
• Lexicographically earliest strictly increasing base 5 autovarious sequence: a(n) = number of distinct a(k) mod 5^n (written in base 5).at n=16A038114
• Lexicographically earliest strictly increasing base 6 autovarious sequence: a(n) = number of distinct a(k) mod 6^n (written in base 6).at n=18A038115
• Lexicographically earliest strictly increasing base 7 autovarious sequence: a(n) = number of distinct a(k) mod 7^n (written in base 7).at n=20A038116
• Lexicographically earliest strictly increasing base 8 autovarious sequence: a(n) = number of distinct a(k) mod 8^n (written in base 8).at n=22A038117
• Lexicographically earliest strictly increasing base 9 autovarious sequence: a(n) = number of distinct a(k) mod 9^n (written in base 9).at n=24A038118
• Number of primes less than 100000n.at n=12A038814
• Coefficients of monic irreducible polynomials over GF(3) listed in lexicographic order.at n=32A058944
• Coefficients of monic primitive irreducible polynomials over GF(3) listed in lexicographic order.at n=15A058949
• Coefficients of irreducible polynomials over GF(3) listed in lexicographic order.at n=36A065020
• Smallest n-digit squarefree number whose internal as well as external digits form a squarefree number greater than 1; or 0 if no such number exists.at n=5A077379
• Least hypotenuse of primitive Pythagorean triangle exceeding 10^n.at n=5A117340
• First gap of length at least n in A137292, lower end.at n=7A138845
• Integers whose decimal representation consists of three distinct digits, one appearing once, one appearing twice, and one appearing three times.at n=8A182040
• Semiprimes with sum of digits 4.at n=16A382073