100000002

Appears in sequences

• Lexicographically earliest strictly increasing base 3 autovarious sequence: a(n) = number of distinct a(k) mod 3^n (written in base 3).at n=33A037091
• Integers k < (reversal of k) such that (reversal of k) + 1 is divisible by k-1.at n=10A052148
• Numbers k such that k^2 contains only digits {0,1,4}, not ending with zero.at n=29A058413
• a(1) = 2, then the smallest squarefree number greater than the previous term that begins with the end of the previous term.at n=21A077209
• a(1) = 1 and a(n+1) is the least number > a(n) that begins with the last digit of a(n) and doesn't end with 0.at n=23A098752
• Numbers k such that k concatenated with k-6 gives the product of two numbers which differ by 5.at n=25A116118
• Numbers with n 0's between 1 and 2.at n=7A133384
• a(n) = smallest number that leads to a new cycle under the Kaprekar map of A151949.at n=15A151964
• Least number k not divisible by 10 such that k^3 contains n zeros.at n=19A241489
• Smallest number k such that no n-digit triangular number begins with k.at n=16A254313
• Concatenate the positions of digits 0, 1, ..., 9 in the decimal representation of n, using 1 for the leftmost digit etc., and 0 when the digit does not occur.at n=19A260520
• Lexicographically earliest sequence of distinct positive terms such that the digitsum of a(n) is the length of a(n+1).at n=31A332701
• Smallest decimal number containing n palindromic substrings (Version 2). See Comments for precise definition.at n=29A361336