Smallest number m such that tau(k) * k = m has exactly n solutions when tau(k) is the number of divisors of k.
A338381
Smallest number m such that tau(k) * k = m has exactly n solutions when tau(k) is the number of divisors of k.
Terms
- a(0) =1a(1) =108a(2) =2688a(3) =21000000a(4) =8400000
External references
- oeis: A338381