1010001

Appears in sequences

• Squares written in base 2.at n=9A001737
• Powers of 3 written in base 2.at n=4A004656
• 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=30A014417
• Roots of 'non-palindromic cubes remaining cubic when written backwards'.at n=17A035125
• Reverse and add (in binary).at n=8A035526
• Lexicographically earliest strictly increasing base 6 autovarious sequence: a(n) = number of distinct a(k) mod 6^n (written in base 6).at n=32A038115
• Sums of 3 distinct powers of 10.at n=26A038445
• Numbers k such that k^2 contains only digits {0,1,2}, not ending with zero.at n=20A058411
• Carryless binary square of n; also Moser-de Bruijn sequence written in binary.at n=13A063010
• Working in base 2, replace n with the concatenation of its prime factors (without repetition).at n=33A065016
• Numbers such that first reversing digits and after forming its cube equals the result of first-form-cube and after-reverse operation with exclusion of cases divisible by 10.at n=32A085315
• a(1) = 111, a(n) = the smallest squarefree number > a(n-1) which contains all the digits of a(n-1).at n=21A086818
• a(n) = 81 written in base n.at n=1A095554
• a(n) = 81 written in base 13 - n.at n=11A095555
• The part of n in base phi left of the decimal point, using a greedy algorithm representation (more precisely, using the Bergman-canonical representation).at n=26A105424
• Semiprimes consisting of digits 0 and 1 only.at n=22A105991
• Sequence A115793 in binary.at n=27A115794
• a(n) = 1 + n^4 + n^6.at n=9A123656
• Minimal (or "greedy") Lucas representation of n, in which L(0) = 2 and L(2) = 3 are not allowed in the same representation (hence the correct representation of the integer 5 is 1010 rather than 101). A binary system of integers with Lucas numbers (A000032) as a base.at n=27A130310
• Numbers n with property that average digit of n^2 is less than 1.at n=23A164842