1010111111

Appears in sequences

• Sums of 8 distinct powers of 10.at n=10A038450
• Table read by antidiagonals: T(n,k) = smallest prime p containing only digits 0 and 1 with n 0's and k 1's, or 0 if no such p exists.at n=38A261173
• Binary representation of the n-th iteration of the "Rule 157" elementary cellular automaton starting with a single ON (black) cell.at n=5A263805
• Binary representation of the n-th iteration of the "Rule 93" elementary cellular automaton starting with a single ON (black) cell.at n=5A267054
• Binary representation of the middle column of the "Rule 233" elementary cellular automaton starting with a single ON (black) cell.at n=9A267879
• 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 35", based on the 5-celled von Neumann neighborhood.at n=9A278344
• 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 49", based on the 5-celled von Neumann neighborhood.at n=24A278466
• Binary representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 105", based on the 5-celled von Neumann neighborhood.at n=9A285826
• Binary representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 593", based on the 5-celled von Neumann neighborhood.at n=11A289578
• Binary representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 597", based on the 5-celled von Neumann neighborhood.at n=10A289763