10110100

Appears in sequences

• Trajectory of binary number 10110 under the operation 'Reverse and Add!' carried out in base 2.at n=4A058042
• Dyck language interpreted as binary numbers in ascending order.at n=12A063171
• The binary encoding of parenthesizations given in a "global arithmetic order", using A061579 as the packing bijection N X N -> N.at n=21A071671
• 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=11A075166
• 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=8A075171
• 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=11A106456
• Sequence A114386 in binary.at n=20A114387
• Sequence A115776 in binary.at n=21A115781
• Sequence A115817 in binary.at n=16A115818
• Sequence A115827 in binary.at n=5A115828
• 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 366", based on the 5-celled von Neumann neighborhood.at n=24A287852
• Binary numbers with string structure 10s00, s in {0,1}*, such that it results in a non-palindromic cycle of length 4 in the Reverse and Add! procedure in base 2.at n=1A306515
• Naturally ordered prime factorization of n as a quasi-logarithmic word over the binary alphabet {1,0}.at n=8A307723
• Numbers formed from decimal digits 0 and/or 1 which are divisible by 7.at n=25A328947
• a(n) is the periodic part on the n-th diagonal from the right of rule-30 1-D cellular automaton, when started from a single ON cell.at n=4A364773