Generalized Stirling transform
From MaRDI portal
Abstract: In this paper, algorithms are developed for computing the Stirling transform and the inverse Stirling transform; specifically, we investigate a class of sequences satisfying a two-term recurrence. We derive a general identity which generalizes the usual Stirling transform and investigate the corresponding generating functions also. In addition, some interesting consequences of these results related to classical sequences like Fibonacci, Bernoulli and the numbers of derangements have been derived.
Recommendations
Cited in
(17)- A class of Frobenius-type Eulerian polynomials
- The partial \(r\)-Bell polynomials
- Recurrence relations of poly-Cauchy numbers by the \(r\)-Stirling transform
- Some remarks on the generalized Apostol-Bernoulli and Apostol-Euler polynomials
- Explicit formulas associated with some families of generalized Bernoulli and Euler polynomials
- Summation algorithms for Stirling number identities
- On \(p\)-Bernoulli numbers and polynomials
- The generalized Stieltjes transform and its inverse
- p-Bernoulli and geometric polynomials
- Arithmetic complexity of the Stirling transforms
- scientific article; zbMATH DE number 5120989 (Why is no real title available?)
- Some inversion formulas and formulas for Stirling numbers
- A three-term recurrence formula for the generalized Bernoulli polynomials
- On poly-Bell numbers and polynomials
- From Madhava-Leibniz to Lehmer's limit
- Recurrence relation for the Appell sequences
- Generalized Laguerre transforms of sequences
This page was built for publication: Generalized Stirling transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5250922)