9369360
domain: N
Appears in sequences
- Least number k such that the number of divisors of k which are < log(k) equals n.at n=16A096001
- Highly abundant numbers (A002093) whose largest prime factor has power greater than 1.at n=31A181310
- a(n) is the least k such that A213636(k) = n.at n=13A326778
- Triangle read by rows: T(n,k) = Sum_{j=0..2k} (-1)^j * binomial(2k,j) * (k-j)^(2n).at n=31A387597