100000001

Appears in sequences

• a(0)=1; a(n) = 10^n + 1, n >= 1.at n=8A000533
• Numbers whose cube is a palindrome.at n=22A002780
• Rows of Sierpiński's triangle (Pascal's triangle mod 2).at n=8A006943
• The number n written using the greedy algorithm in the base where the values of the places are 1 and primes.at n=20A007924
• Cyclotomic polynomials at x=10.at n=15A019328
• Cyclotomic polynomials at x=-10.at n=16A020509
• Palindromes of form k^2 + 1.at n=10A027720
• Odd numbers which when cubed give number composed just of the digits 0, 1, 2, 3.at n=9A031997
• Lexicographically earliest strictly increasing base-2 autovarious sequence: a(n) = number of distinct a(k) mod 2^n (written in base 2).at n=19A037090
• Lexicographically earliest strictly increasing base 3 autovarious sequence: a(n) = number of distinct a(k) mod 3^n (written in base 3).at n=32A037091
• Lexicographically earliest strictly increasing base 8 autovarious sequence: a(n) = number of distinct a(k) mod 8^n (written in base 8).at n=33A038117
• Sums of 2 distinct powers of 10.at n=28A038444
• a(n) is the smallest value of m such that A002378(m), the m-th oblong number, contains exactly n 0's.at n=13A048529
• Numbers whose fourth power is a palindrome.at n=9A056810
• Palindromes only using 0 and 1 (i.e., base-2 palindromes).at n=31A057148
• a(n) = n^8 + 1.at n=10A060890
• a(n) = 10^n + 1.at n=8A062397
• Carryless binary square of n; also Moser-de Bruijn sequence written in binary.at n=17A063010
• Positions of nonzero coefficients in cyclotomic polynomial Phi_n(x), A063670 in binary.at n=16A063671
• Sequence A019320 in binary.at n=16A063672