Given a set $S$ containing all possible permutations of a vector $v = (1, 2, 3, ..., n-1, n)$, find the size of the set $P$, where $P$ is defined as the set of possible component-wise sums obtained by adding $k$ elements of $S$ together. Each element in $P$ is a sum of $k$ vectors from $S$, i.e. $P=\sum_{i=1}^kS$. I'm wondering if there is a nice looking formula for $|P|$ as a function of $n$ and $k$.
Edit: the main reason why I'm considering this is the following. Imagine $n$ players play a game. Each round, they get ranked (without ties). The best player gets $n$ points, the second best $n-1$, etc... and the last one only gets $1$. These points gets added to the scoreboard, which starts at $0$ for each player. I want to know how many possible scoreboards there are after $k$ rounds.