100000010

Appears in sequences

• The number n written using the greedy algorithm in the base where the values of the places are 1 and primes.at n=21A007924
• Lexicographically earliest strictly increasing base-2 autovarious sequence: a(n) = number of distinct a(k) mod 2^n (written in base 2).at n=20A037090
• Sums of 2 distinct powers of 10.at n=29A038444
• Multiples of 2 whose digit sum is 2.at n=29A069537
• a(1) = 1, a(n) = the smallest squarefree number > a(n-1) which contains all the digits of a(n-1).at n=15A077712
• Bit string encoding occurrence of digits of n in decimal representation: d-th bit is set iff d occurs in (n)10, 0 <= d < 10.at n=18A086067
• Concatenate number of occurrences in n of each decimal digit from 0 to 9 and drop leading zeros.at n=18A100909
• Sequence A115831 in binary.at n=26A115832
• The number n written using the minimum number of terms in the base where the values of the places are 1 and primes (noncomposites). For multiple solutions the smallest binary value is chosen.at n=21A185101
• 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=35A190149
• a(n) = n^8 + n.at n=10A196288
• Binary representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 30", based on the 5-celled von Neumann neighborhood.at n=21A285536
• Let c(i) be the number of times the digit i appears in n, for 0 <= i <= 9; then a(n) is the concatenation of c(9) c(8) ... c(1) c(0), with leading 0's omitted.at n=18A348783
• A048715, written in binary.at n=30A350215
• Smallest decimal number containing n palindromic substrings (Version 2). See Comments for precise definition.at n=25A361336
• n in base whose greedy place values are quarter-squares (A002620).at n=27A376450