1800000
domain: N
Appears in sequences
- Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*10^j.at n=26A038228
- Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*3^j.at n=22A038305
- Numbers n such that the sum of all numbers formed by deleting one digit from n is equal to n.at n=1A131639
- Integers that can be generated with a C/C++ expression that is three or more characters shorter than their decimal representation.at n=17A168652
- Number of paths through the subset array whose trace is a permutation of (1,2,...,n); see Comments.at n=5A208651
- Number of n step walks (each step +-1 starting from 0) which are never more than 4 or less than -4.at n=22A216212
- Base-10 complementary numbers: n equals the product of the 10's complement of its digits.at n=20A294090
- Numbers k such that sum of digits (k) and sum of digits (k^2) is 9.at n=20A325450
- Number of n-digit positive integers that are the product of two integers ending with 5.at n=7A337855
- Numbers m such that the smallest digit in the decimal expansion of 1/m is 5, ignoring leading and trailing 0's.at n=28A352159