We have $k$ different objects and $n$ different boxes. In how many ways can we put those objects into boxes so that each box gets 0, 1 or 2 objects? Each object has to be in a box.
This looks different than any of the standard combinatorial problems (like partitions etc). It's relatively easy to express this as a sum or to get some kind of recursive formula, but can we get a closed formula?