1010010

Appears in sequences

• 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=31A014417
• Sums of 3 distinct powers of 10.at n=27A038445
• In the list of divisors of n (in binary), each digit 0-1 appears equally often.at n=9A045799
• Sequence A084457 in binary.at n=12A084456
• a(1) = 111, a(n) = the smallest squarefree number > a(n-1) which contains all the digits of a(n-1).at n=22A086818
• a(n) = 82 written in base n.at n=1A095556
• a(n) = 82 written in base 11 - n.at n=9A095557
• 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=27A105424
• Sequence A115823 in binary.at n=15A115824
• Sequence A115825 in binary.at n=9A115826
• Semiprimes written in base 2.at n=26A122466
• 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=26A130310
• Binary expansion of numbers in A171757.at n=25A171758
• Convert n to binary, use as coefficients of polynomial in GF(2)[x], apply the map f defined in A185000, write down coefficient vector of the result, highest powers first.at n=33A185544
• Even numbers n (written in binary) such that in base-2 lunar arithmetic, the sum of the divisors of n is a number containing a 0 (in binary).at n=9A190149
• NegaFibonacci representation code for n.at n=17A215022
• Binary representation of the middle column of the "Rule 41" elementary cellular automaton starting with a single ON (black) cell.at n=6A266612
• Write A003512(n) in the base {1, 3, 4, 11, 15, 41, 56, 153, 209, ...} (see A002530).at n=19A276387
• Binary representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 406", based on the 5-celled von Neumann neighborhood.at n=12A288042
• Binary representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 406", based on the 5-celled von Neumann neighborhood.at n=13A288042