100010000

Appears in sequences

• Smallest oblong (promic) number containing exactly n 0's.at n=6A048530
• Carryless binary square of n; also Moser-de Bruijn sequence written in binary.at n=20A063010
• Decimal numbers n such that after possibly prefixing leading 0's to n, the resulting number n' can be broken into 2 numbers of equal length, n' = xy, such that x^2+y^2 = n (y may also have leading zeros).at n=8A064942
• a(n) is the unique k such that palindrome A068065(n) = k + reverse(k).at n=24A068910
• Concatenate number of occurrences in n of each decimal digit from 0 to 9 and drop leading zeros.at n=15A100909
• a(n) = 10^(2*n) + 10^n.at n=3A163664
• Sequence A005418 written in base 2.at n=9A164370
• The number n written using the minimum number of terms in the base where the values of the places are 1 and primes (noncomposites). For multiple solutions the smallest binary value is chosen.at n=26A185101
• Binary representation of the n-th iteration of the "Rule 102" elementary cellular automaton starting with a single ON (black) cell.at n=4A265319
• Binary representation of n in base i-1.at n=12A271472
• Positive integers of the form x*10^k + y which also equal x^2 + y^2 (x, y and k being positive integers).at n=11A275986
• 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 41", based on the 5-celled von Neumann neighborhood.at n=8A278422
• 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 201", based on the 5-celled von Neumann neighborhood.at n=8A279799
• 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 283", based on the 5-celled von Neumann neighborhood.at n=8A280528
• 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 297", based on the 5-celled von Neumann neighborhood.at n=8A280613
• 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 355", based on the 5-celled von Neumann neighborhood.at n=8A281305
• 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 393", based on the 5-celled von Neumann neighborhood.at n=15A281740
• 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 809", based on the 5-celled von Neumann neighborhood.at n=11A284176
• 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 225", based on the 5-celled von Neumann neighborhood.at n=8A286961
• 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 417", based on the 5-celled von Neumann neighborhood.at n=8A288057