On the solution space of the Golomb recursion
From MaRDI portal
Publication:4685499
DOI10.1080/10236198.2018.1471471zbMath1444.11029OpenAlexW2803286074WikidataQ129838433 ScholiaQ129838433MaRDI QIDQ4685499
Matthew Sunohara, Stephen M. Tanny
Publication date: 9 October 2018
Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10236198.2018.1471471
Related Items (2)
An exploration of solutions to two related Hofstadter-Huber recurrence relations ⋮ A combinatorial approach for constructing non-monotonic solutions to the generalized Golomb recursion
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Nested recursions, simultaneous parameters and tree superpositions
- Meta-Fibonacci sequences, binary trees and extremal compact codes
- A well-behaved cousin of the Hofstadter sequence
- Trees and meta-Fibonacci sequences
- Solving non-homogeneous nested recursions using trees
- Constructing New Families of Nested Recursions with Slow Solutions
- Spot-Based Generations for Meta-Fibonacci Sequences
- A combinatorial approach for solving certain nested recursions with non-slow solutions
- On the Behavior of a Family of Meta-Fibonacci Sequences
This page was built for publication: On the solution space of the Golomb recursion