1010100

Appears in sequences

• Expansion of Product_{k>=1} (1-x^k)^26.at n=10A010831
• Representation of n in base of Fibonacci numbers (the Zeckendorf representation of n). Also, binary words starting with 1 not containing 11, with the word 0 added.at n=32A014417
• Sums of 3 distinct powers of 10.at n=28A038445
• Trajectory of binary number 10110 under the operation 'Reverse and Add!' carried out in base 2.at n=2A058042
• Carryless binary square of n; also Moser-de Bruijn sequence written in binary.at n=14A063010
• Expansion of x(1+100x)/((1-x^2)(1-100x^2)).at n=6A094027
• a(n) = 84 written in base n.at n=1A095560
• a(n) = 84 written in base 16 - n.at n=14A095561
• The part of n in base phi left of the decimal point, using a greedy algorithm representation (more precisely, using the Bergman-canonical representation).at n=28A105424
• Numbers k whose digits can be divided into two contiguous parts, k = concatenate(x, y), such that k = |x^2 - y^2|.at n=18A113797
• Sequence A114384 in binary.at n=4A114385
• Sequence A115772 in binary.at n=17A115773
• Sequence A115774 in binary.at n=8A115775
• Sequence A115823 in binary.at n=16A115824
• Sequence A115825 in binary.at n=10A115826
• Members of A016052 whose digit sum is three.at n=27A119507
• Minimal (or "greedy") Lucas representation of n, in which L(0) = 2 and L(2) = 3 are not allowed in the same representation (hence the correct representation of the integer 5 is 1010 rather than 101). A binary system of integers with Lucas numbers (A000032) as a base.at n=28A130310
• Smallest composite integer in base n which remains composite after altering any one or two digits.at n=0A133219
• a(0) = 1, a(n) = sum of binary digits of all prior terms, expressed in binary.at n=30A157845
• Numbers k which are concatenations k = x//y such that x^2 - y^2 is a multiple of k.at n=12A162701