Generalized Stirling transform
M Rahmani�- arXiv preprint arXiv:1212.0957, 2012 - arxiv.org
arXiv preprint arXiv:1212.0957, 2012•arxiv.org
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.
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.
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.
arxiv.org