Say we have $m$ buckets. We select a random bucket and put a ball in it, we repeat this $n$ times. In the end what is the probability of having at least one bucket with exactly $k$ balls?
I have tried several approaches, the closest I got is this. The probability of putting first $k$ balls into that cell is $\frac1{m^k}$ and not putting the rest of the balls is $\left( 1 - \frac1{m} \right)^{n-k}$. We have $\left(\begin{smallmatrix}n\\k\end{smallmatrix}\right)$ such configurations, i.e. a cell getting $k$ balls and not having the rest, hence the final probability is: $$ \begin{pmatrix}n\\k\end{pmatrix} \frac1{m^k} \left( 1 - \frac1{m} \right)^{n-k} $$
We have $m$ such cells, so the final probability is: $$ m\begin{pmatrix}n\\k\end{pmatrix} \frac1{m^k} \left( 1 - \frac1{m} \right)^{n-k} $$
I have implemented a simulation where I simulate the procedure million times and report the results. For small probabilities simulation and the expression produces close results. However for particular values they don't coincide.
I suspect that the expression above needs more terms, but for small probabilities those terms tend to be very small and could be discarded to approximate.
EDIT Problem solved, see the answer below.