This paper deals with an occupancy problem regarding the probability that m1 and m2 boxes each contain exactly one ball from groups 1 and 2, respectively, resulting from distributing k1 group 1 and k2 group 2 balls into n boxes. The solution to this problem is given by a set of recursive expressions. By virtue of these expressions, it is easy to obtain the numerical values of the probability distribution by using a computer.
