Summary: We consider a generalization of the Frobenius problem, where the object of interest is the greatest integer having exactly $j$ representations by a collection of positive relatively prime integers. We prove an analogue of a theorem of Brauer and Shockley and show how it can be used for computation.

11D45, 45A05

Frobenius problem, counting solutions of Diophantine equations, linear integral equations