MathNet 2014 Question 80

Let $n$ be a strictly positive integer. For any natural number $k$, we denote by $a(k)$ the number of natural divisors $d$ of $k$ such that $k \le d^2 \le n^2$. Compute the sum $\sum_{k=1}^{n^2} a(k)$.