Constructing New Families of Nested Recursions with Slow Solutions
From MaRDI portal
Publication:2808166
DOI10.1137/15M1040505zbMath1415.11025WikidataQ60692541 ScholiaQ60692541MaRDI QIDQ2808166
No author found.
Publication date: 26 May 2016
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
nested recursionConway sequenceHofstadter sequence\(V\) sequencefamily of nested recursionsslowly growing solution
Related Items (11)
On some properties of a meta-Fibonacci sequence connected to Hofstadter sequence and Möbius function ⋮ An exploration of solutions to two related Hofstadter-Huber recurrence relations ⋮ Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation ⋮ On Hofstadter heart sequences ⋮ On some properties of the Hofstadter-Mertens function ⋮ A combinatorial approach for constructing non-monotonic solutions to the generalized Golomb recursion ⋮ On a conjecture about generalized \(Q\)-recurrence ⋮ A New Approach to the Hofstadter $Q$-Recurrence ⋮ On the solution space of the Golomb recursion ⋮ On a generalization of Hofstadter's \(Q\)-sequence: a family of chaotic generational structures ⋮ Connecting slow solutions to nested recurrences with linear recurrent sequences
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nested recursions, simultaneous parameters and tree superpositions
- On variants of Conway and Conolly's meta-Fibonacci recursions
- Meta-Fibonacci sequences, binary trees and extremal compact codes
- A well-behaved cousin of the Hofstadter sequence
- A matrix dynamics approach to Golomb's recursion
- Another variation on Conway's recursive sequence
- On a strange recursion of Golomb
- On Conway's recursive sequence
- Trees and meta-Fibonacci sequences
- Nested recursions with ceiling function solutions
- Nested Recurrence Relations with Conolly-like Solutions
- A Combinatorial Interpretation for Certain Relatives of the Conolly Sequence
- Conway's Challenge Sequence
- Automatic Sequences
- SOME SEQUENCES RESEMBLING HOFSTADTER'S
- Spot-Based Generations for Meta-Fibonacci Sequences
- ‘Golomb-like’ nested recursions with Beatty function solutions
- A combinatorial approach for solving certain nested recursions with non-slow solutions
- A VARIANT OF HOFSTADTER’S SEQUENCE AND FINITE AUTOMATA
- On the Behavior of a Family of Meta-Fibonacci Sequences
This page was built for publication: Constructing New Families of Nested Recursions with Slow Solutions