Iterated sums of arithmetic progressions

Using generating functions we obtain a closed form expression involving two binomial coefficients for the iterated or k-fold summation of an arbitrary arithmetic progression of real numbers. As a contrast we obtain the same closed form expression using an elementary method based on an examination of Pascal's triangle. Some combinatorial interpretations of the iterated sums are also provided.