I made this question up so I have no guarantee that there is a clean answer. It seems like there should be a simple approach though, I’m just not seeing it.
First attempt:
Find the chance that only the first k boxes are left empty. Then we can multiply by ##{n \choose k}## to get the total...