On solutions to a general combinatorial recurrence
From MaRDI portal
Recommendations
- A combinatorial approach to a general two-term recurrence
- Recurrent combinatorial sums and binomial-type theorems
- Recurrence relations and enumerative interpretations of some combinatorial numbers and polynomials
- Recurrences of Stirling and Lah numbers via second kind Bell polynomial
- The solution of the recurrence relationfn(t)=an(t) fn−1(t)−bn(t)(∂/∂t) fn−1(t</i
Cited in
(27)- Some applications of the generalized Eulerian numbers
- Triangular sequences, combinatorial recurrences and linear difference equations
- A combinatorial approach to a general two-term recurrence
- Bivariate generating functions for a class of linear recurrences: general structure
- Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees
- Triangular recurrences, generalized Eulerian numbers, and related number triangles
- A combinatorial proof of a general two-term recurrence.
- Cross recurrence relations for \(r\)-Lah numbers.
- A generalized recurrence for Bell numbers
- scientific article; zbMATH DE number 4023286 (Why is no real title available?)
- Recurrence relations and enumerative interpretations of some combinatorial numbers and polynomials
- scientific article; zbMATH DE number 3467211 (Why is no real title available?)
- scientific article; zbMATH DE number 1303203 (Why is no real title available?)
- scientific article; zbMATH DE number 741508 (Why is no real title available?)
- scientific article; zbMATH DE number 2070535 (Why is no real title available?)
- The Egg-Drop Numbers
- The binomial recurrence
- Combinatorial recurrences and linear difference equations
- Recurrent combinatorial sums and binomial-type theorems
- On a generalization of the recurrence defining the number of derangements
- On the General Solution of the Heideman–Hogan Family of Recurrences
- The combinatorialization of linear recurrences
- Some q-Analogues of Certain Combinatorial Numbers
- Recursively defined combinatorial functions: Extending Galton's board
- Boson operator ordering identities from generalized Stirling and Eulerian numbers
- On hypersequences of an arbitrary sequence and their weighted sums. II.
- Closed-form formulas of two Gauss hypergeometric functions of specific parameters
This page was built for publication: On solutions to a general combinatorial recurrence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404187)