Constructing new families of nested recursions with slow solutions
From MaRDI portal
Publication:2808166
Recommendations
- Nested recursions, simultaneous parameters and tree superpositions
- A combinatorial approach for solving certain nested recursions with non-slow solutions
- On families of solutions for meta-Fibonacci recursions related to Hofstadter-Conway \$10000 sequence
- Nested recurrence relations with Conolly-like solutions
- A new approach to the Hofstadter \(Q\)-recurrence
Cites work
- scientific article; zbMATH DE number 2186884 (Why is no real title available?)
- scientific article; zbMATH DE number 5577875 (Why is no real title available?)
- scientific article; zbMATH DE number 637308 (Why is no real title available?)
- scientific article; zbMATH DE number 194969 (Why is no real title available?)
- scientific article; zbMATH DE number 5274232 (Why is no real title available?)
- A Combinatorial Interpretation for Certain Relatives of the Conolly Sequence
- A combinatorial approach for solving certain nested recursions with non-slow solutions
- A matrix dynamics approach to Golomb's recursion
- A variant of Hofstadter's sequence and finite automata
- A well-behaved cousin of the Hofstadter sequence
- Another variation on Conway's recursive sequence
- Automatic Sequences
- Conway's Challenge Sequence
- Generalized meta-Fibonacci sequences
- How the shift parameter affects the behavior of a family of meta-Fibonacci sequences
- Meta-Fibonacci sequences, binary trees and extremal compact codes
- Nested recurrence relations with Conolly-like solutions
- Nested recursions with ceiling function solutions
- Nested recursions, simultaneous parameters and tree superpositions
- On Conway's recursive sequence
- On a strange recursion of Golomb
- On the Behavior of a Family of Meta-Fibonacci Sequences
- On variants of Conway and Conolly's meta-Fibonacci recursions
- SOME SEQUENCES RESEMBLING HOFSTADTER'S
- Spot-based generations for meta-Fibonacci sequences
- The On-Line Encyclopedia of Integer Sequences
- Trees and meta-Fibonacci sequences
- ‘Golomb-like’ nested recursions with Beatty function solutions
Cited in
(14)- On Hofstadter heart sequences
- On a generalization of Hofstadter's \(Q\)-sequence: a family of chaotic generational structures
- On some properties of the Hofstadter-Mertens function
- Connecting slow solutions to nested recurrences with linear recurrent sequences
- A combinatorial approach for solving certain nested recursions with non-slow solutions
- A combinatorial approach for constructing non-monotonic solutions to the generalized Golomb recursion
- On some properties of a meta-Fibonacci sequence connected to Hofstadter sequence and Möbius function
- Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation
- Nested recursions, simultaneous parameters and tree superpositions
- An exploration of solutions to two related Hofstadter-Huber recurrence relations
- On a conjecture about generalized \(Q\)-recurrence
- Recursive constructions for large caps
- On the solution space of the Golomb recursion
- A new approach to the Hofstadter \(Q\)-recurrence
This page was built for publication: Constructing new families of nested recursions with slow solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808166)