1010110

Appears in sequences

• Least positive multiple of n written in base 6 using only 0 and 1.at n=37A004286
• Sums of 4 distinct powers of 10.at n=21A038446
• The Roman numerals, with "i" replaced by "1", "v" replaced by "5", "x" replaced by 10, etc.at n=28A093788
• a(n) = 86 written in base n.at n=1A095564
• a(n) = 86 written in base 14 - n.at n=12A095565
• Sequence A115768 in binary.at n=4A115769
• Sequence A115797 in binary.at n=21A115798
• Sequence A115821 in binary.at n=13A115822
• Semiprimes written in base 2.at n=28A122466
• Maximal (or "lazy") Lucas representation of n. Binary system for representing integers using Lucas numbers (A000032) as a base.at n=29A130311
• Ordered list in binary of the subwords (with leading zeros omitted) appearing in the infinite Fibonacci word.at n=17A171676
• Binary expansion of numbers in A171757.at n=27A171758
• Binary numbers with curling number 1.at n=30A219763
• Binary representation of the middle column of the "Rule 9" elementary cellular automaton starting with a single ON (black) cell.at n=6A266247
• Write A003512(n) in the base {1, 3, 4, 11, 15, 41, 56, 153, 209, ...} (see A002530).at n=20A276387
• 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 473", based on the 5-celled von Neumann neighborhood.at n=7A282447
• 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=19A309870
• Numbers with only digits "1" and three digits "0".at n=21A379270
• a(n) = AN-run sequence of the n-th 01-word, where all 01-words are lexicographically ordered as in A076478; see Comments.at n=20A390505