220000
domain: N
Appears in sequences
- Expansion of 1/(1-10*x)^10.at n=3A053109
- Triangle read by rows: T(n,k)=k^3*2^k*binomial(2n-k,n-k)/(2n-k) (1<=k<=n).at n=40A112327
- 3-smooth numbers in ternary representation.at n=35A131096
- Numbers k such that k and k^2 use only the digits 0, 2, 3, 4 and 8.at n=51A136885
- Numbers k such that k and k^2 use only the digits 0, 2, 4 and 8.at n=32A136908
- Integers that can be generated with a C/C++ expression that is two or more characters shorter than their decimal representation.at n=21A168651
- Numbers k such that k^2 has only digits 0, 4 and 8.at n=36A202170
- a(n) = n^2*(7*n - 5)/2.at n=40A262000
- Number of partitions of the (n+6)-multiset {0,...,0,1,2,...,n} with six 0's into distinct multisets.at n=7A346816
- Number of partitions of the (n+7)-multiset {0,...,0,1,2,...,7} with n 0's into distinct multisets.at n=6A346827
- Numbers m such that the smallest digit in the decimal expansion of 1/m is 4, ignoring leading and trailing 0's.at n=35A352158
- Numbers with as many zeros as the sum of their digits.at n=34A354410
- Number of even digits necessary to write all positive n-digit integers.at n=4A358439
- Numbers of the form d_1 d_2 d_3 ... where the sum of their digits multiplied by their digit positions is equal to their number of digits.at n=15A381135