110000
domain: N
Appears in sequences
- a(n) = n^2 written in base 3.at n=18A001738
- Expansion of g.f.: (1+x)/(1-10*x).at n=5A003953
- Binary reflected Gray code.at n=32A014550
- Numbers k such that k is a substring of its base-2 representation.at n=29A038102
- Sums of 2 distinct powers of 10.at n=14A038444
- When cubed gives number composed just of the digits 0, 1, 2, 3.at n=21A043681
- Numbers k such that the square of d(k) (number of divisors) divides k.at n=36A046754
- When cubed gives number composed just of the digits 0, 1, 2, 3, 4.at n=38A048792
- Sums of two powers of 10.at n=19A052216
- Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 1, 3, 5 respectively, while the other bits have their usual weights. -1 if no such string exists.at n=48A066329
- Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 2, 4, 2 respectively, while the other bits have their usual weights. -1 if no such string exists.at n=48A066334
- Multiples of 2 whose digit sum is 2.at n=14A069537
- Numbers divisible by the 4th power of the sum of their digits in base 10.at n=13A072083
- Write n in binary and replace 0 with 00.at n=11A084472
- Write n in binary and replace 0 with 0000.at n=5A084474
- a(n) = A007088(A084483(n)).at n=23A084484
- Array A085211 in binary.at n=40A085213
- Array A085212 in binary.at n=40A085214
- a(n) = 15n^2 + 13n^3.at n=20A085377
- Erroneous version of A052216.at n=9A094629