100022
domain: N
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=27A037089
- Lexicographically earliest strictly increasing base 5 autovarious sequence: a(n) = number of distinct a(k) mod 5^n (written in base 5).at n=17A038114
- Lexicographically earliest strictly increasing base 7 autovarious sequence: a(n) = number of distinct a(k) mod 7^n (written in base 7).at n=21A038116
- Lexicographically earliest strictly increasing base 8 autovarious sequence: a(n) = number of distinct a(k) mod 8^n (written in base 8).at n=23A038117
- Lexicographically earliest strictly increasing base 9 autovarious sequence: a(n) = number of distinct a(k) mod 9^n (written in base 9).at n=25A038118
- Coefficients of monic irreducible polynomials over GF(3) listed in lexicographic order.at n=33A058944
- Coefficients of irreducible polynomials over GF(3) listed in lexicographic order.at n=37A065020
- Primes of form 4k+3 written in base 3.at n=28A072805
- Where records occur in A117831.at n=23A118474
- Integers whose decimal representation consists of three distinct digits, one appearing once, one appearing twice, and one appearing three times.at n=9A182040
- a(n) is the smallest number k such that d(1)*1! + d(2)*2! + ... + d(p)*p! = n^2, where d(i) are the decimal digits of k.at n=40A198095
- a(n) = A239460(n) / n^2.at n=21A239463
- "Inside numbers". Pick a term "t" and one of its digits "d". Now jump to the right over d digits if "d" is odd, and to the left over d digits if "d" is even. Whatever the "d" you choose, you will stay on "t".at n=41A284515
- Ternary numbers consisting of a run of 1's, then a run of 0's, then a run of 2's.at n=11A371055
- Ternary numbers that are concatenated runs A(1)B(1)C(1)A(2)B(2)C(2)...A(k)B(k)C(k), where A(i) is a run of 1's, B(i) a run of 0's, and C(i) a run of 2's, for i = 1..k.at n=11A371105