Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
469855 | Computers & Mathematics with Applications | 2008 | 7 Pages |
Abstract
The alternate Sylvester sums are Tm(a,b)=∑n∈NR(−1)nnmTm(a,b)=∑n∈NR(−1)nnm, where aa and bb are coprime, positive integers, and NRNR is the Frobenius set associated with aa and bb. In this note, we study the generating functions, recurrences and explicit expressions of the alternate Sylvester sums. It can be found that the results are closely related to the Bernoulli polynomials, the Euler polynomials, and the (alternate) power sums over the natural numbers.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Weiping Wang, Tianming Wang,