100001

Appears in sequences

• Numbers written in base of triangular numbers.at n=21A000462
• a(0)=1; a(n) = 10^n + 1, n >= 1.at n=5A000533
• a(n) = n^5 + 1.at n=11A002561
• Numbers whose square is a palindrome.at n=31A002778
• Numbers whose cube is a palindrome.at n=12A002780
• Least positive multiple of n written in base 4 using only 0 and 1.at n=40A004284
• Least positive multiple of n written in base 8 using only 0 and 1.at n=32A004288
• Numbers with mirror symmetry about middle.at n=35A006072
• The binary numbers (or binary words, or binary vectors, or binary expansion of n): numbers written in base 2.at n=33A007088
• The number n written using the greedy algorithm in the base where the values of the places are 1 and primes.at n=12A007924
• n written in base where place values are positive squares.at n=36A007961
• 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=14A014417
• Strong pseudoprimes to base 10.at n=15A020236
• Divisors of 9999999999.at n=24A027895
• Numbers k such that k^2 is a palindrome with an odd number of digits.at n=30A028816
• Numbers k such that k^3 has at most three different digits.at n=56A030294
• Odd numbers which when cubed give number composed just of the digits 0, 1, 2, 3.at n=5A031997
• 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=22A037089
• Lexicographically earliest strictly increasing base-2 autovarious sequence: a(n) = number of distinct a(k) mod 2^n (written in base 2).at n=9A037090
• Lexicographically earliest strictly increasing base 3 autovarious sequence: a(n) = number of distinct a(k) mod 3^n (written in base 3).at n=28A037091