11001010

Appears in sequences

• Dyck language interpreted as binary numbers in ascending order.at n=14A063171
• The binary encoding of parenthesizations given in a "global arithmetic order", using A061579 as the packing bijection N X N -> N.at n=7A071671
• The binary encoding of parenthesizations given in a "global arithmetic order", using A001477 as the packing bijection N X N -> N.at n=13A071672
• 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=13A075171
• Concatenate all natural numbers starting with 1 in binary like this 11011100101110111100010011010..., then a(n) = the number formed from the next n digits (by dropping leading zeros). 1, 10, 111, 0010, 11101, 111000, ... 1, 10, 111, 10, 11101, 111000, ...at n=10A100751
• 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=20A106456
• Even numbers n (written in binary) such that in base-2 lunar arithmetic, the sum of the divisors of n is a number containing a 0 (in binary).at n=29A190149
• Numbers n such that n occurs within its base 2 representation regarded as a fixed necklace, but n is not a substring of the base 2 representation regarded as a string.at n=7A225238