Abstract
We give explicit expressions for higher order binomial convolutions of sequences of numbers having a finite exponential generating function. Illustrations involving Cauchy, Bernoulli, and Apostol–Euler numbers are presented. In these cases, we obtain formulas easy to compute in terms of Stirling numbers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.