101100

Appears in sequences

• Positive numbers having the same set of digits in base 2 and base 10.at n=39A037415
• Numbers k such that k is a substring of its base-2 representation.at n=26A038102
• Sums of 3 distinct powers of 10.at n=15A038445
• Dyck language interpreted as binary numbers in ascending order.at n=5A063171
• Binary string which equals n when 1's, 2's, 4's and 8's bits have weights -1, 1, 3, 6 respectively, while the other bits have their usual weights. -1 if no such string exists.at n=41A066327
• Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 1, 3, 5 respectively, while the other bits have their usual weights. -1 if no such string exists.at n=40A066329
• Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 2, 4, 5 respectively, while the other bits have their usual weights. -1 if no such string exists.at n=41A066330
• a(n) = A036229(n) - 111...1 (with n 1's).at n=25A068086
• The binary encoding of parenthesizations given in a "global arithmetic order", using A061579 as the packing bijection N X N -> N.at n=6A071671
• The binary encoding of parenthesizations given in a "global arithmetic order", using A001477 as the packing bijection N X N -> N.at n=5A071672
• Digitally balanced numbers: binary numbers which have the same number of 0's as 1's; decimal representation: A031443.at n=9A071925
• 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=5A075166
• 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=4A075171
• Smallest multiple of n having an equal number of ones and zeros and no other digits.at n=11A079793
• 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=3A080070
• Sequence A084451 in binary.at n=19A084450
• a(n) = A007088(A084483(n)).at n=21A084484
• Reducible polynomials over GF(2) in binary format.at n=32A091254
• a(n) = 44 written in base n.at n=1A095480
• a(n) = 44 written in base 14 - n.at n=12A095481