Using the Fundamental Theorem of Arithmetic we have 630 = 2 * (3^2) * 5 * 7. So 630 = 0 Mod 2, 0 Mod 3, 2 Mod 4, 0 Mod 5 & 0 Mod 6.
Now suppose the number of rows (n) is 2, 3, 4, 5, or 6 and the first row has 1 child. The numbers of children in these row groups is 5 = 1 Mod 2, 12 = 0 Mod 3 & 0 Mod 6, 22 = 2 Mod 4, 35 = 0 Mod 5 and 51 = 3 Mod 6.
The trick is that increasing the number of children in Row 1 by k adds k * n to the total, which means that the Mod n value of each row group of n rows does not change.
For n = 3 the number of children in the first row will be odd so that the 0 Mod 6 case applies.
So for 2 rows or 6 rows the Mod value <> the Mod value of 630. For 3, 4 or 5 rows the Mod value = the Mod value of 630.
So 2 and 6 are not possible and 3, 4 & 5 are possible.
QED
