Solving non-homogeneous nested recursions using trees (Q2441387): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:47, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving non-homogeneous nested recursions using trees |
scientific article |
Statements
Solving non-homogeneous nested recursions using trees (English)
0 references
24 March 2014
0 references
In this well written paper, it is shown how certain nested non-homogeneous versions of \(k\)-term nested recursions including a constant term are connected to counting \(n\) leaves in certain infinte trees corresponding to these recursions using a tree grafting method that inserts copies of a finite tree in it. Also if the initial conditions are varied the same terchnique leads to a solution.
0 references
non-homogeneous nested recursion
0 references
meta-Fibonacci sequence
0 references
Conolly sequence
0 references
