I have $n$ bins and $k$ balls such that $n \lt 2k$.
In how many ways can I distribute the $k$ balls in the $n$ bins subject to following constraints:
1) A bin gets max one ball.
2) No two successive bins are empty.
Not sure if there is a clean solution to this. Have been thinking about it for a bit.