Trees and meta-Fibonacci sequences
From MaRDI portal
Recommendations
Cited in
(23)- Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation
- On Hofstadter heart sequences
- On a conjecture about generalized \(Q\)-recurrence
- On a generalization of Hofstadter's Q-sequence: a family of chaotic generational structures
- Solving non-homogeneous nested recursions using trees
- Constructing new families of nested recursions with slow solutions
- On families of solutions for meta-Fibonacci recursions related to Hofstadter-Conway \$10000 sequence
- A Combinatorial Interpretation for Certain Relatives of the Conolly Sequence
- How the shift parameter affects the behavior of a family of meta-Fibonacci sequences
- Generalized meta-Fibonacci sequences
- scientific article; zbMATH DE number 3961638 (Why is no real title available?)
- Nested recursions, simultaneous parameters and tree superpositions
- On the solution space of the Golomb recursion
- A new approach to the Hofstadter \(Q\)-recurrence
- A combinatorial interpretation of Hofstadter's G-sequence
- A combinatorial problem solved by a meta-Fibonacci recurrence relation
- On the Behavior of a Family of Meta-Fibonacci Sequences
- A combinatorial approach for constructing non-monotonic solutions to the generalized Golomb recursion
- On variants of Conway and Conolly's meta-Fibonacci recursions
- Connecting slow solutions to nested recurrences with linear recurrent sequences
- Solutions of certain meta-Fibonacci recurrences
- Meta-automatic sequences
- Meta-Fibonacci sequences, binary trees and extremal compact codes
This page was built for publication: Trees and meta-Fibonacci sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380294)