1000000010

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=25A007924
• Binary expansion of n does not contain 1-bits at even positions. Integers whose base 4 representation consists of only 0's and 2s.at n=17A062033
• Smallest multiple of n with digit sum = 2, or 0 if no such number exists, e.g., a(3k)=0.at n=33A069521
• Smallest multiple of n with least digit sum.at n=33A077194
• a(1) = 1, a(n) = the smallest squarefree number > a(n-1) which contains all the digits of a(n-1).at n=17A077712
• Smallest n-digit palindromic multiple of n. For n = 10k it is sufficient that the multiple is palindromic with leading zeros ignored. 0 if no such number exists.at n=9A084013
• 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=19A086067
• Binary equivalents of A103745.at n=9A105032
• Least n-digit multiple of n whose digit permutations yield at least n distinct multiples of n, or 0 if no such number exists.at n=9A113599
• A simple sequence a(n) = n + n^(n-1).at n=9A172165
• 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=25A185101
• a(n) = n^9 + n.at n=10A196290
• Smallest n-digit number ending in n.at n=9A266959
• Binary representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 113", based on the 5-celled von Neumann neighborhood.at n=18A278904
• 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 390", based on the 5-celled von Neumann neighborhood.at n=24A287979
• 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 390", based on the 5-celled von Neumann neighborhood.at n=25A287979
• A 5 X 5 pandiagonal magic square read by rows: the entries have digits which are only 0's and 1's and form a magic square in any base b >= 2.at n=22A348269
• 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=19A348783
• Smallest decimal number containing n palindromic substrings (Version 2). See Comments for precise definition.at n=32A361336