1000110

Appears in sequences

• Sums of 3 distinct powers of 10.at n=22A038445
• Numbers in binary representation with odd length.at n=28A079112
• Sequence A084451 in binary.at n=29A084450
• Sequence A084457 in binary.at n=7A084456
• a(1) = 111, a(n) = the smallest squarefree number > a(n-1) which contains all the digits of a(n-1).at n=18A086818
• a(n) = 70 written in base n.at n=1A095532
• a(n) = 70 written in base 11 - n.at n=9A095533
• Sequence A115821 in binary.at n=12A115822
• Members of A016052 whose digit sum is three.at n=25A119507
• Numbers k such that k and k^2 use only the digits 0, 1, 2 and 6.at n=42A136827
• Numbers k such that k and k^2 use only the digits 0, 1, 2 and 7.at n=42A136831
• Numbers k such that k and k^2 use only the digits 0, 1, 2, 7 and 8.at n=44A136832
• a(0) = 1, a(n) = sum of binary digits of all prior terms, expressed in binary.at n=26A157845
• Binary expansion of numbers in A171757.at n=19A171758
• Binary expansion of numbers in A171781.at n=35A171782
• a(1) = 10, a(2) = 1. For n >= 3, a(n) = concatenate a(n-1), a(n-2), ..., a(1) and then divide the resulting number by a(n-1).at n=4A181868
• Convert n to binary, use as coefficients of polynomial in GF(2)[x], apply the map f defined in A185000, write down coefficient vector of the result, highest powers first.at n=41A185544
• Even numbers n (written in binary) such that in base-2 lunar arithmetic, the sum of the divisors of n is a number containing a 0 (in binary).at n=6A190149
• Smallest n-Smith number.at n=10A195191
• a(n) is a binary vector for selecting distinct terms from A000124 that when summed give n; it uses the greedy algorithm.at n=28A204009