A numerical semigroup is a cofinite subset of the non-negative integers that is closed under addition. For a randomly generated numerical semigroup, the expected number of minimum generators can be expressed in terms of a doubly-indexed sequence of integers, denoted h_n,i, that count generating sets with certain properties. We prove a recurrence that implies the sequence h_n,i is eventually quasipolynomial when the second parameter is fixed.