Counting ways to partition a set into fixed number of subsets
What you want is the Stirling numbers of the second kind. A Stirling number of the second kind counts the number of ways to partition a set of $n$ objects into $k$ non-empty subsets. It is usually denoted by $\left\{ n \atop k \right\}$.
See the Wikipedia article for methods to compute such numbers.