Generalized stirling transform

19Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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 twoterm 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

CITATION STYLE

APA

Rahmani, M. (2014). Generalized stirling transform. Miskolc Mathematical Notes, 15(2), 677–690. https://doi.org/10.18514/mmn.2014.1084

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free