  In responding to a question on Math Stackexchange, the author formulated the
problem of determining the number of strings of balls colored in most $n$
colors with a number $k$ of repeated colors. In this paper, we formulate the
problem more formally, and solve several variations.
