Abstract.
In this paper, we solve a general, four-parameter recurrence by both algebraic and combinatorial methods. The Bell numbers and some closely related sequences are solutions to the recurrence corresponding to particular choices of the parameters.
Received: 2011-02-14
Revised: 2011-07-04
Accepted: 2011-10-18
Published Online: 2012-05-31
Published in Print: 2012-June
© 2012 by Walter de Gruyter Berlin Boston
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Masthead
- On a Theorem of Prachar Involving Prime Powers
- A Novel Approach to the Discovery of Binary BBP-Type Formulas for Polylogarithm Constants
- A Recurrence Related to the Bell Numbers
- Sum-Product Estimates Applied to Waring's Problem over Finite Fields
- Communal Partitions of Integers
- On Computation of Exact van der Waerden Numbers
- On the Complexity of Chooser–Picker Positional Games
- Partition of an Integer into Distinct Bounded Parts, Identities and Bounds
- A Correlation Identity for Stern's Sequence
- Primitive Prime Divisors in Zero Orbits of Polynomials
Keywords for this article
Bell Number;
Stirling Number;
Recurrence;
Combinatorial Proof
Articles in the same Issue
- Masthead
- On a Theorem of Prachar Involving Prime Powers
- A Novel Approach to the Discovery of Binary BBP-Type Formulas for Polylogarithm Constants
- A Recurrence Related to the Bell Numbers
- Sum-Product Estimates Applied to Waring's Problem over Finite Fields
- Communal Partitions of Integers
- On Computation of Exact van der Waerden Numbers
- On the Complexity of Chooser–Picker Positional Games
- Partition of an Integer into Distinct Bounded Parts, Identities and Bounds
- A Correlation Identity for Stern's Sequence
- Primitive Prime Divisors in Zero Orbits of Polynomials