Every textbook on combinatorics seems to deal with either totally indistinguishable objects and bins, or completely distinguishable objects and bins. What I have is something in between: objects are of $t$ types, there are $a\_i$ objects of type $i$, and there are $k$ indistinguishable bins. How many partitions are there? Is there any theory that deals with this kind of situations? Thanks.