There is a card game that I have been playing lately which can be played with a deck of only $15$ cards. There are exactly $3$ of each type of card, so there are $5$ types of cards. Cards of the same type should be considered completely indistinguishable from eachother (ie, any notion of 'suit' or the like is not relevant if the deck were to utilize normal playing cards).
If believe that this means that the number of ways that the deck can be initially shuffled therefore is $$ \frac{15!}{{3!}^5} $$ This works out to be $168,168,000$ ways that the deck can be shuffled.
I am wondering, however, how many different ways this game could be initially dealt for a given number of players. Each player is dealt only $2$ cards, and the number of players is limited to $5$, so there will always be left over cards where the order of them does not contribute to the initial deal. Further, the order of the two cards in each player's initial deal does not matter either.
How would I go about calculating the number of possible initial deals for $n$ players?