The multiserver queue with Poisson arrivals and Erlangian, gamma or chi-square service time is solved for the steady state case. A general procedure, adaptable to computer programming, for writing the equations for the state probabilities is given. Generating functions for the time invariant state probabilities are found. A method of computing numerical solutions is described.