A method for calculating the individual group congestion and the overall loss in a sequentially hunted skipped grading which is offered unbalanced traffic is presented. Based on Wilkinson's equivalent random theory, the paper offers two approaches to the solution of the blocking equations, one iterative, and the other making use of Rapp's approximations. The values produced by both are compared with those obtained from simulation for a number of different gradings.