1000000001
domain: N
Appears in sequences
- a(0)=1; a(n) = 10^n + 1, n >= 1.at n=9A000533
- Numbers whose cube is a palindrome.at n=27A002780
- Rows of Pascal's triangle mod 3.at n=9A006940
- The number n written using the greedy algorithm in the base where the values of the places are 1 and primes.at n=24A007924
- Divisors of 10^9 + 1.at n=31A027901
- Odd numbers which when cubed give number composed just of the digits 0, 1, 2, 3.at n=10A031997
- a(n) is the smallest value of m such that A002378(m), the m-th oblong number, contains exactly n 0's.at n=15A048529
- Numbers whose fourth power is a palindrome.at n=10A056810
- a(n) = 10^n + 1.at n=9A062397
- Palindromes of the form k^3 + 1.at n=7A062840
- Number of digits in n^(n^(n-1)).at n=9A067083
- Palindromes n for which there is a unique k such that n = k + reverse(k).at n=28A068065
- Smallest multiple of n with digit sum = 2, or 0 if no such number exists, e.g., a(3k)=0.at n=18A069521
- Numbers k such that k and k^3 are both palindromes.at n=26A069748
- Harmless numbers: numbers without a, h, m or r.at n=49A073416
- Smallest n-digit squarefree number.at n=9A074109
- Numbers of the form (10^(m*r)-1)/(10^r-1) for positive integers m, r.at n=21A076289
- Smallest multiple of n with least digit sum.at n=18A077194
- Smallest n-digit squarefree number beginning with n.at n=9A077513
- Smallest n-digit composite palindrome.at n=9A077543