A general method is presented for evaluating the sums of "m"th powers of the integers that can, and that cannot, be represented in the two-element Frobenius problem. Generating functions are introduced and used for that purpose. Explicit formulas for the desired sums are obtained and specific examples are discussed.

This note describes a method for evaluating the sums of the m -th powers of n consecutive terms of a general arithmetic sequence: { S[subscript m] = 0, 1, 2,...}. The method is based on the use of a differential operator that is repeatedly applied to a generating function. A known linear recurrence is then obtained and the m-th sum, S[subscript…