111001

Appears in sequences

• Least positive multiple of n written in base 3 using only 0 and 1.at n=21A004283
• Least positive multiple of n written in base 5 using only 0 and 1.at n=37A004285
• Least positive multiple of n written in base 5 using only 0 and 1.at n=33A004285
• Least positive multiple of n written in base 7 using only 0 and 1.at n=25A004287
• Least positive multiple of n written in base 9 using only 0 and 1.at n=30A004289
• Roots of 'non-palindromic cubes remaining cubic when written backwards'.at n=11A035125
• Number of 4-ary rooted trees with n nodes and height exactly 8.at n=17A036632
• Lexicographically earliest strictly increasing base 4 autovarious sequence: a(n) = number of distinct a(k) mod 4^n (written in base 4).at n=32A038113
• Sums of 4 distinct powers of 10.at n=12A038446
• Binary Gleichniszahlen-Reihe (BGR) sequence: describe previous term (cf. A005150), reduce number of digits seen mod 2 (then for the purposes of this data-base, discard leading zeros).at n=4A045998
• Sequence A019320 in binary.at n=18A063672
• Integers n such that n = A067030(j) for some j and A067286(j) < A067034(j).at n=22A068798
• a(n) = A007088(A084483(n)).at n=28A084484
• Numbers such that first reversing digits and after forming its cube equals the result of first-form-cube and after-reverse operation with exclusion of cases divisible by 10.at n=24A085315
• a(n) = 57 written in base n.at n=1A095506
• a(n) = 57 written in base 14 - n.at n=12A095507
• Odd positive integers in base 2 (bisection of A007088).at n=28A099821
• Semiprimes consisting of digits 0 and 1 only.at n=12A105991
• a(n)=Sum(d|n)(10^(n-d)).at n=5A113978
• Sequence A115795 in binary.at n=11A115796