Generalized Stirling transform
Combinatorics
2012-12-06 v1 Number Theory
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.
Cite
@article{arxiv.1212.0957,
title = {Generalized Stirling transform},
author = {Mourad Rahmani},
journal= {arXiv preprint arXiv:1212.0957},
year = {2012}
}
Comments
12 pages