In how many ways we can have some natural numbers that their sum is equal to $n$ and none of them is greater than $k$, for given $n$ and $k$?
NOTE: We don't know the number of the elements.
Can anyone help me with this problem? I can't find anything on the internet. For example, for $n = 5$ and $k = 2$ the answer is $8$:
2 + 2 + 1, 2 + 1 + 2, 1 + 2 + 2, 1 + 1 + 1 + 2, 1 + 1 + 2 + 1
1 + 2 + 1 + 1, 2 + 1 + 1 + 1, 1 + 1 + 1 + 1 + 1