100101

Appears in sequences

• Least positive multiple of n written in base 3 using only 0 and 1.at n=22A004283
• Least positive multiple of n written in base 5 using only 0 and 1.at n=22A004285
• Least positive multiple of n written in base 9 using only 0 and 1.at n=28A004289
• Primes written in base 2.at n=11A004676
• The binary numbers (or binary words, or binary vectors, or binary expansion of n): numbers written in base 2.at n=37A007088
• 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=17A014417
• Roots of 'non-palindromic cubes remaining cubic when written backwards'.at n=5A035125
• Lexicographically earliest strictly increasing base-2 autovarious sequence: a(n) = number of distinct a(k) mod 2^n (written in base 2).at n=12A037090
• Positive numbers having the same set of digits in base 2 and base 10.at n=32A037415
• Lexicographically earliest strictly increasing base 4 autovarious sequence: a(n) = number of distinct a(k) mod 4^n (written in base 4).at n=22A038113
• Lexicographically earliest strictly increasing base 5 autovarious sequence: a(n) = number of distinct a(k) mod 5^n (written in base 5).at n=18A038114
• Sums of 3 distinct powers of 10.at n=11A038445
• Numbers whose sum of digits is 3.at n=38A052217
• Numbers k for which there exists some m such that k = Sum_{i=1..1+floor(log_10(k))} binomial(m, d_i), where d_i is the i-th digit of k.at n=35A055481
• Numbers k such that k^2 contains only digits {0,1,2}, not ending with zero.at n=13A058411
• Coefficients of irreducible polynomials over GF(2) listed in lexicographic order.at n=8A058943
• Coefficients of primitive irreducible polynomials over GF(2) listed in lexicographic order.at n=6A058947
• Working in base 2, replace n with the concatenation of its prime factors (without repetition).at n=36A065016
• Binary string which equals n when 1's, 2's, 4's and 8's bits have weights -1, 1, 3, 6 respectively, while the other bits have their usual weights. -1 if no such string exists.at n=34A066327
• Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 1, 3, 5 respectively, while the other bits have their usual weights. -1 if no such string exists.at n=36A066329