Solving non-homogeneous nested recursions using trees (Q2441387): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Stephen M. Tanny / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Herman J. Tiersma / rank | |||
Normal rank | |||
Revision as of 16:16, 19 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
