Note that τ(n) is odd if and only if n is a perfect square. Thus, it suffices to find the number of integers n in the given range such that τ(n)=k2 for some positive integer k. If k=1, then we obtain n=1 as our only solution. If k=2, we see that n is either in the form pq or p3, where p and q are distinct primes. The first subcase gives 8+4+1=13 solutions, while the second subcase gives 2 solutions. k=3 implies that n is a perfect square, and it is easy to see that only 62=36 works. Finally, k≥4 implies that n is greater than 50, so we've exhausted all possible cases. Our final answer is 1+13+2+1=17.
Source: Omni-MATH,
licensed Apache-2.0.
Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.