10110010

Appears in sequences

• Dyck language interpreted as binary numbers in ascending order.at n=11A063171
• Binary expansion of n followed by its reverse complement.at n=10A066489
• The binary encoding of parenthesizations given in a "global arithmetic order", using A061579 as the packing bijection N X N -> N.at n=15A071671
• The binary encoding of parenthesizations given in a "global arithmetic order", using A001477 as the packing bijection N X N -> N.at n=20A071672
• 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=14A075166
• 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=9A075171
• Decimal encoding of parenthesizations produced by simple iteration starting from empty parentheses and where each successive parenthesization is obtained from the previous by reflecting it as a general tree/parenthesization, then adding an extra stem below the root and then reflecting the underlying binary tree.at n=4A080070
• 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=8A106456
• 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=25A190149
• 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 225", based on the 5-celled von Neumann neighborhood.at n=11A279988
• Binary representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 446", based on the 5-celled von Neumann neighborhood.at n=14A288336
• Naturally ordered prime factorization of n as a quasi-logarithmic word over the binary alphabet {1,0}.at n=10A307723