10000001

Appears in sequences

• Numbers written in base of triangular numbers.at n=36A000462
• a(0)=1; a(n) = 10^n + 1, n >= 1.at n=7A000533
• Numbers whose cube is a palindrome.at n=18A002780
• The number n written using the greedy algorithm in the base where the values of the places are 1 and primes.at n=18A007924
• Odd numbers which when cubed give number composed just of the digits 0, 1, 2, 3.at n=8A031997
• 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=32A037089
• Lexicographically earliest strictly increasing base-2 autovarious sequence: a(n) = number of distinct a(k) mod 2^n (written in base 2).at n=18A037090
• Lexicographically earliest strictly increasing base 3 autovarious sequence: a(n) = number of distinct a(k) mod 3^n (written in base 3).at n=31A037091
• Lexicographically earliest strictly increasing base 7 autovarious sequence: a(n) = number of distinct a(k) mod 7^n (written in base 7).at n=23A038116
• Lexicographically earliest strictly increasing base 8 autovarious sequence: a(n) = number of distinct a(k) mod 8^n (written in base 8).at n=26A038117
• Lexicographically earliest strictly increasing base 9 autovarious sequence: a(n) = number of distinct a(k) mod 9^n (written in base 9).at n=29A038118
• Sums of 2 distinct powers of 10.at n=21A038444
• When cubed gives number composed just of the digits 0, 1, 2, 3.at n=32A043681
• a(n) is the smallest value of m such that A002378(m), the m-th oblong number, contains exactly n 0's.at n=11A048529
• Sums of two powers of 10.at n=28A052216
• If n = 2^a * 3^b * 5^c * 7^d * ... then a(n) = a + 10 * b + 100 * c + 1000 * d + ... .at n=37A054841
• Numbers whose fourth power is a palindrome.at n=8A056810
• Palindromes only using 0 and 1 (i.e., base-2 palindromes).at n=23A057148
• Numbers k such that k^2 contains only digits {0,1,2}, not ending with zero.at n=24A058411
• a(n) = 10^n + 1.at n=7A062397