100200

Appears in sequences

• Binary numbers with 2 replacing 1 in odd positions.at n=36A095914
• a(n+1) is the least integer > a(n) containing all digits of a(n); a(1)=2.at n=23A155890
• Sum of any three adjacent digits of n^2 is a square.at n=39A174397
• Smallest n-Smith number.at n=9A195191
• Base 3 numbers that have digits that sum to 3.at n=35A218043
• The smallest n-digit number where first k digits are divisible by k-th Fibonacci number for k = 1..n.at n=5A242808
• Number of compositions of n with difference -2 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=17A242839
• Numbers n such that there exists an x!=n that makes {x,x,n} an amicable multiset.at n=10A259303
• Concatenate the positions of digits 9, 8,..., 0 in the decimal representation of n, using 1 for the rightmost digit etc., and 0 when the digit does not occur.at n=25A260521
• In base 3, 0, together with numbers of the form i00j00k00m00... where i = 1 or 2 and j,k,m,... are 0, 1, or 2.at n=21A261660
• Write A003511(n) in the base {1, 3, 4, 11, 15, 41, 56, 153, 209, ...} (see A002530).at n=35A276386
• G.f. satisfies: A(x) = (1+x)/(1-x) * A(x^2)*A(x^3)*A(x^4)*...*A(x^n)*... .at n=23A318767
• Nonzero ternary words such that any non-initial 1 is preceded by 0, and any non-initial 2 is preceded by 00.at n=37A324474
• Numbers whose number of distinct prime factors is greater than the sum of their digits.at n=33A327786