111000

Appears in sequences

• Least positive multiple of n that when written in base 10 uses only 0's and 1's.at n=23A004290
• Sums of 3 distinct powers of 10.at n=19A038445
• Least multiple of n consisting of a succession of 1's followed by a succession of 0's.at n=23A052983
• Dyck language interpreted as binary numbers in ascending order.at n=8A063171
• Positions of negative coefficients in cyclotomic polynomial Phi_n(x), A063698 in binary.at n=30A063699
• Binary expansion of n followed by its reverse complement.at n=6A066489
• The binary encoding of parenthesizations given in a "global arithmetic order", using A061579 as the packing bijection N X N -> N.at n=9A071671
• The binary encoding of parenthesizations given in a "global arithmetic order", using A001477 as the packing bijection N X N -> N.at n=3A071672
• Digitally balanced numbers: binary numbers which have the same number of 0's as 1's; decimal representation: A031443.at n=13A071925
• 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=15A075166
• 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=15A075171
• Smallest multiple of n having an equal number of ones and zeros and no other digits.at n=7A079793
• Smallest multiple of n having an equal number of ones and zeros and no other digits.at n=23A079793
• Breadth-first-wise A063171-like-encoding of the stunted binomial-mod-2 zigzag trees (A080264).at n=1A080269
• Breadth-first-wise A063171-like-encoding of A080299-trees.at n=1A080314
• Breadth-first-wise A063171-like-encoding of the branch-reduced binomial-mod-2 binary trees (A080294).at n=1A080319
• Sequence A084451 in binary.at n=32A084450
• a(n) = 56 written in base n.at n=1A095504
• a(n) = 56 written in base 14 - n.at n=12A095505
• Even nonnegative integers in base 2 (bisection of A007088).at n=28A099820