Stones

Two players play a game with a single pile of $N$ stones. On each turn, a player may take any pile and split it into several smaller piles, so that the number of stones in each new pile differs from the others by at least $K$.

For example, if K = 2, a pile of $9$ stones can be split into $(1,8)$, $(2,7)$, $(3,6)$, or (1, 3, 5). The player who cannot make a move loses.

Given $N$, find all values of $K$ (0 \leq K \leq N) for which the second player has a winning strategy.