10101110

Appears in sequences

• Binary representation of the middle column of the "Rule 129" elementary cellular automaton starting with a single ON (black) cell.at n=7A267443
• Binary representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 457", based on the 5-celled von Neumann neighborhood.at n=13A282360
• 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 601", based on the 5-celled von Neumann neighborhood.at n=8A283218
• Concatenate prime factorization as in A080670, but write everything in binary.at n=35A287874
• a(n) = Sum_{m=0..n} 3^v3(m!), where v3(m!) is the exponent of the highest power of 3 dividing n!, expressed in base 3.at n=16A294493
• a(n) is the smallest number whose digits are 1's and 0's that cannot be written as a concatenation of any of the previous terms (not repeating any terms in the concatenation). a(0) = 0.at n=29A309870