Arithmetic Functions · Superchallenge problem

How many positive integers $n \le 10\,000$ satisfy $\tau(n^2) = 3\,\tau(n)$, where $\tau(m)$ is the number of positive divisors of $m$?