#combinatorial-designs

Arrange the numbers $1,1,2,2,\dots ,n,n$ in a row so that for each $k$ exactly $k$ other numbers stand between the two copies of $k$. For $n=3$ the sequence 2, 3, 1, 2, 1, 3 works. For which $n$ is such an arrangement possible?