1000001

Appears in sequences

• Numbers written in base of triangular numbers.at n=28A000462
• a(0)=1; a(n) = 10^n + 1, n >= 1.at n=6A000533
• a(n) = n^6 + 1.at n=10A002604
• Numbers whose square is a palindrome.at n=37A002778
• Numbers whose cube is a palindrome.at n=15A002780
• The number n written using the greedy algorithm in the base where the values of the places are 1 and primes.at n=14A007924
• Numbers that do not contain the letter 't'.at n=57A008523
• Liponombres: numbers whose French name does not contain the letter "e".at n=13A014254
• Representation of n in base of Fibonacci numbers (the Zeckendorf representation of n). Also, binary words starting with 1 not containing 11, with the word 0 added.at n=22A014417
• Palindromes of form k^2 + 1.at n=6A027720
• Numbers k such that k^2 is a palindrome with an odd number of digits.at n=35A028816
• Odd numbers which when cubed give number composed just of the digits 0, 1, 2, 3.at n=7A031997
• 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=31A037089
• Lexicographically earliest strictly increasing base-2 autovarious sequence: a(n) = number of distinct a(k) mod 2^n (written in base 2).at n=17A037090
• Lexicographically earliest strictly increasing base 3 autovarious sequence: a(n) = number of distinct a(k) mod 3^n (written in base 3).at n=29A037091
• Lexicographically earliest strictly increasing base 5 autovarious sequence: a(n) = number of distinct a(k) mod 5^n (written in base 5).at n=26A038114
• Lexicographically earliest strictly increasing base 6 autovarious sequence: a(n) = number of distinct a(k) mod 6^n (written in base 6).at n=19A038115
• Lexicographically earliest strictly increasing base 7 autovarious sequence: a(n) = number of distinct a(k) mod 7^n (written in base 7).at n=22A038116
• Lexicographically earliest strictly increasing base 8 autovarious sequence: a(n) = number of distinct a(k) mod 8^n (written in base 8).at n=25A038117
• Lexicographically earliest strictly increasing base 9 autovarious sequence: a(n) = number of distinct a(k) mod 9^n (written in base 9).at n=28A038118