10101010

Appears in sequences

• Numbers whose base-10 representation has exactly 8 runs.at n=0A043644
• In the list of divisors of n (in binary), each digit 0-1 appears equally often.at n=15A045799
• Alternate digits 1 and 0.at n=8A056830
• Binary expansion of n does not contain 1-bits at even positions. Integers whose base 4 representation consists of only 0's and 2s.at n=15A062033
• Dyck language interpreted as binary numbers in ascending order.at n=9A063171
• Working in base 2, replace n with the concatenation of its prime divisors in increasing order.at n=15A064841
• Binary expansion of n followed by its reverse complement.at n=9A066489
• The binary encoding of parenthesizations given in a "global arithmetic order", using A061579 as the packing bijection N X N -> N.at n=10A071671
• Quadruplets: base 10 representation is the juxtaposition of four identical strings.at n=9A074843
• Natural numbers mapped to Dyck path encodings of the rooted plane trees obtained by recursing on the exponents of the prime factorization of n.at n=6A075166
• Nonnegative integers mapped to Dyck path encodings of the rooted plane trees obtained by recursing on the run lengths of the binary expansion of n.at n=10A075171
• Catalan paths: numbers starting with 1 and ending with 0 where each digit is nonnegative and adjacent digits differ by 1.at n=8A079214
• a(n) = floor((n+3)^(n+2)/((n+3)^2-1)).at n=7A089816
• Lexicographically earliest increasing sequence with property that in the concatenation of its terms every pair of consecutive digits differs by 1.at n=25A098766
• Natural numbers mapped to Dyck path encodings of the rooted plane trees obtained by recursing on the exponents of the GF(2)[X] factorization of n.at n=10A106456
• Sequence A114384 in binary.at n=9A114385
• Sequence A115774 in binary.at n=12A115775
• Sequence A115823 in binary.at n=25A115824
• Sequence A115825 in binary.at n=18A115826
• A020988 written in base 2.at n=3A163662