My question is similar to the birthday problem, but I can't seem to find a simple solution. The question (in a general form) is that, given a set of $n$ people who each choose elements from a set of $N$ elements ($p = 1/N$), what is the expected number (mean $\mu_x = E(x)$) of unique destinations that will be chosen provided an infinite number of trials.
For a specific example, imagine a skyscraper with $N$ floors and an elevator full of people on floor 0 with capacity $n$. The question, then, would be how many different stops, on average, will the elevator have to make on its trip to the $N^{th}$ floor, if it stops at every floor where $\geq1$ people need to get out.
From solutions of the birthday problem, I know that there are $n(1-\frac{1}{N})^{n-1}$ unique destinations, and $n(1-(1-\frac{1}{N})^{n-1})$ people who share a destination. From this, shouldn't the expected number of unique destinations be $n(1-\frac{1}{N})^{n-1} + n(1-(1-\frac{1}{N})^{n-1})\cdot($mean # of people who have chosen the same destination given that at least 2 people have chosen it$)$? The problem (for me at least) is determining this last term.
Thanks!