10010110

Appears in sequences

• Reverse and add (in binary).at n=9A035526
• Binary expansion of n followed by its reverse complement.at n=8A066489
• Digitally balanced numbers: binary numbers which have the same number of 0's as 1's; decimal representation: A031443.at n=20A071925
• a(n) = concatenation of first n elements of Thue-Morse sequence A010059.at n=7A102397
• 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=20A190149
• Consider numbers m in the range 2^n <= m < 2^(n+1); the smallest A215244(m) in this range is k=A215245(n); a(n) = binary representation of m for the first time this k appears.at n=7A215254
• Binary words beginning with 1 which are abelian squares.at n=20A272654
• 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 318", based on the 5-celled von Neumann neighborhood.at n=15A287626
• Sequence of balanced, multiplicative binary words, starting with a(1)=1, a(2)=10; for j > 2, if j is a prime, then a(j) is obtained by appending 0 at the end of a(j-1); otherwise, a(j) is obtained by appending a single digit at the end of a(j-1) such that the new word is multiplicative, but if the obtained a(j) is not balanced, then we change the digit at the rightmost possible prime position (and, eventually, some digits at following nonprime positions to maintain multiplicativity) so that a(j) becomes balanced.at n=7A351386