1011111

Appears in sequences

• Least positive multiple of n written in base 3 using only 0 and 1.at n=33A004283
• Least positive multiple of n written in base 7 using only 0 and 1.at n=29A004287
• Least positive multiple of n written in base 8 using only 0 and 1.at n=24A004288
• Sums of 6 distinct powers of 10.at n=1A038448
• A086070 in binary.at n=17A086084
• a(n) = 95 written in base n.at n=1A095582
• a(n) = 95 written in base 11 - n.at n=9A095583
• Triangle read by rows: row n lists partitions of n-th triangular number into triangular parts.at n=16A114738
• Sequence A115772 in binary.at n=21A115773
• Consider the Levenshtein distance between k considered as a decimal string and k considered as a binary string. Then a(n) is the greatest number m such that the Levenshtein distance is n or 0 if no such number exists.at n=13A115779
• Sequence A115776 in binary.at n=11A115781
• Semiprimes written in base 2.at n=33A122466
• Maximal (or "lazy") Lucas representation of n. Binary system for representing integers using Lucas numbers (A000032) as a base.at n=35A130311
• Integers written in base phi, with the "decimal point" omitted.at n=4A130601
• Squares in lunar arithmetic in base 2 written in base 2.at n=11A171222
• Squares in lunar arithmetic in base 3 written in base 3.at n=32A171396
• Binary expansion of numbers in A171763.at n=30A171764
• Binary expansions of odd numbers with a single zero in their binary expansion.at n=10A190619
• Numbers from A193414 written in base 2.at n=30A193415
• The number n written using a minimizing algorithm in the base where the values of the places are 1 and primes.at n=31A205598