# On Solutions to a General Combinatorial Recurrence

@inproceedings{Spivey2010OnST, title={On Solutions to a General Combinatorial Recurrence}, author={Michael Z. Spivey}, year={2010} }

- Published 2010

We develop techniques that can be applied to find solutions to the recurrence ∣∣n k ∣∣ = ( n+ k + )∣∣n−1 k ∣∣+ ( ′n+ ′k + ′)∣∣n−1 k−1∣∣+ [n = k = 0]. Many interesting combinatorial numbers, such as binomial coefficients, both kinds of Stirling and associated Stirling numbers, Lah numbers, Eulerian numbers, and second-order Eulerian numbers, satisfy special cases of this recurrence. Our techniques yield explicit expressions in the instances = − , = ′ = 0, and = ′ + 1, adding to the result of… CONTINUE READING

#### Citations

##### Publications citing this paper.

Showing 1-4 of 4 extracted citations

## Bivariate generating functions for a class of linear recurrences: General structure

View 5 Excerpts

Highly Influenced

## A combinatorial approach to a general two-term recurrence

View 4 Excerpts

Highly Influenced

#### References

##### Publications referenced by this paper.

Showing 1-10 of 15 references

## Statistics on wreath products and generalized binomial-Stirling numbers

View 4 Excerpts

Highly Influenced

## Recursively defined combinatorial functions: extending Galton's board

View 5 Excerpts

Highly Influenced

## A generalized recurrence for Bell numbers

View 5 Excerpts

## Steil . The kbinomial transforms and the Hankel transform

## Cakić . On the numbers related to the Stirling numbers of the second kind

## Combinatorial sums and finite differences

View 9 Excerpts

## On the numbers related to the Stirling numbers of the second kind

View 3 Excerpts

## The k-Binomial Transforms and the Hankel Transform

View 1 Excerpt

## Some recurrence formulas related to the differential operator D

View 3 Excerpts