The representation of integers as sums of squares

We present a uniform method by which we obtain an explicit formula for the number of representations of an integer as the sum of n squares for each n in the range 2 ≤ n ≤ 8. The final formulas for odd n are new, though those for even n are not. We also present a formula for the dominant term for the number for an arbitrary n.