I've tried googling it and looking it up on this website but since I don't know the technical term for this calculation I ran out of luck. Basically, if I have a collection of numbers (each of which may have duplicates) how many unique combinations of $n$ numbers can I make by picking from that collection?
(This question addresses the same issue)
For example:
$C = \{ 1, 2, 2, 3, 3, 3 \}$ and I want to know how many combinations of $2$ numbers I can make.
Glancing over the collection, I can quickly see I can only make the following pairs:
$P = \{ (1,2),(1,3),(2,2),(2,3),(3,3) \}$
Which gives me the answer $|P|=5$.
But if I want to find the number of combinations of $4$ numbers, I can't just enumerate all the possible $4$-tuples because there's no way to make $(1,1,1,1)$ or $(1,2,2,2)$, for example.
Is there a way to calculate this in general using combinatorics?