Basically we want to write $n$ as the sum of positive integers not greater than $k$, and we want to minimize number of terms. So there are $\lceil n/k\rceil$ terms. How many such sequences are there?
Two sequences are distinct if they contain different numbers at some position. That is we're counting ordered sequences.