The solution of the recurrence relationfn(t)=an(t) fn−1(t)−bn(t)(∂/∂t) fn−1(t
From MaRDI portal
Publication:3634516
DOI10.1080/10236190802282677zbMath1171.39001OpenAlexW2060358308MaRDI QIDQ3634516
Toufik Mansour, Matthias Schork
Publication date: 25 June 2009
Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10236190802282677
Uses Software
Cites Work
- Unnamed Item
- Identities among certain triangular matrices
- Generalized binomial coefficients and the subset-subspace problem
- The boson normal ordering problem and generalized Bell numbers
- A characterization of inverse relations.
- The general boson normal ordering problem
- A Unified Interpretation of the Binomial Coefficients, the Stirling Numbers, and the Gaussian Coefficients
- Recursions for the flag-excedance number in colored permutations groups
- Über eine Verallgemeinerung der Differenzengleichung der Stirlingschen Zahlen 2. Art und einige damit zusammenhängende Fragen.
- Recursively defined combinatorial functions: Extending Galton's board
This page was built for publication: The solution of the recurrence relationfn(t)=an(t) fn−1(t)−bn(t)(∂/∂t) fn−1(t</i