Abstract
In this paper, many properties of several sequences such as Binomial coefficients, the falling numbers, and Stirling numbers of the second kind are discussed. We use these properties to find recurrence equations for the sums of powers σ m (n) = ∑k m interm of Binomial coefficients and Stirling numbers.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
