The solution of the recurrence relation<i>f</i><sub><i>n</i></sub>(<i>t</i>)=<i>a</i><sub><i>n</i></sub>(<i>t</i>) <i>f</i><sub><i>n</i>−1</sub>(<i>t</i>)−<i>b</i><sub><i>n</i></sub>(<i>t</i>)(∂/∂<i>t</i>) <i>f</i><sub><i>n</i>−1</sub>(<i>t</i>) (Q3634516)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The solution of the recurrence relation<i>f</i><sub><i>n</i></sub>(<i>t</i>)=<i>a</i><sub><i>n</i></sub>(<i>t</i>) <i>f</i><sub><i>n</i>−1</sub>(<i>t</i>)−<i>b</i><sub><i>n</i></sub>(<i>t</i>)(∂/∂<i>t</i>) <i>f</i><sub><i>n</i>−1</sub>(<i>t</i>) |
scientific article |
Statements
The solution of the recurrence relation<i>f</i><sub><i>n</i></sub>(<i>t</i>)=<i>a</i><sub><i>n</i></sub>(<i>t</i>) <i>f</i><sub><i>n</i>−1</sub>(<i>t</i>)−<i>b</i><sub><i>n</i></sub>(<i>t</i>)(∂/∂<i>t</i>) <i>f</i><sub><i>n</i>−1</sub>(<i>t</i>) (English)
0 references
25 June 2009
0 references
recurrence relations
0 references
Stirling numbers
0 references
generating functions
0 references
Catalan numbers
0 references
explicit formula
0 references
0 references
