Nice Sequence

Let $$a_1,a_2,\ldots, a_n$$ a sequence of integers such that $$a_k$$ is the number of multiples of $$k$$ in the sequence, for all $$k = 1, 2, \ldots , n$$. How many values $$​n$$ can take?

×