10001010

Appears in sequences

• Binary expansion of n does not contain 1-bits at even positions. Integers whose base 4 representation consists of only 0's and 2s.at n=11A062033
• Sequence A084457 in binary.at n=15A084456
• a(1) = 111, a(n) = the smallest squarefree number > a(n-1) which contains all the digits of a(n-1).at n=28A086818
• Sequence A115819 in binary.at n=14A115820
• 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=16A190149
• NegaFibonacci representation for -n.at n=25A215023
• Binary representation of the middle column of the "Rule 25" elementary cellular automaton starting with a single ON (black) cell.at n=7A266445
• Binary representation of the middle column of the "Rule 91" elementary cellular automaton starting with a single ON (black) cell.at n=7A267044
• Binary representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 157", based on the 5-celled von Neumann neighborhood.at n=14A279468
• 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 358", based on the 5-celled von Neumann neighborhood.at n=28A287782
• 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 358", based on the 5-celled von Neumann neighborhood.at n=29A287782
• An expanded binary notation for n: the normal binary expansion for n is expanded by mapping each 1 to 10 and retaining the existing 0's.at n=19A304453