Trees and meta-Fibonacci sequences
zbMATH Open1188.05011MaRDI QIDQ2380294FDOQ2380294
Authors: Abraham Isgur, David Reiss, Stephen M. Tanny 
Publication date: 26 March 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/231856
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Trees (05C05) Exact enumeration problems, generating functions (05A15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Cited In (22)
- A combinatorial interpretation of Hofstadter's \(G\)-sequence
- Nested recursions, simultaneous parameters and tree superpositions
- On variants of Conway and Conolly's meta-Fibonacci recursions
- On a conjecture about generalized \(Q\)-recurrence
- On a generalization of Hofstadter's \(Q\)-sequence: a family of chaotic generational structures
- On families of solutions for meta-Fibonacci recursions related to Hofstadter-Conway \$10000 sequence
- Meta-Fibonacci sequences, binary trees and extremal compact codes
- How the shift parameter affects the behavior of a family of meta-Fibonacci sequences
- Generalized meta-Fibonacci sequences
- Connecting slow solutions to nested recurrences with linear recurrent sequences
- Solving non-homogeneous nested recursions using trees
- On the Behavior of a Family of Meta-Fibonacci Sequences
- On the solution space of the Golomb recursion
- Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation
- Constructing new families of nested recursions with slow solutions
- A Combinatorial Interpretation for Certain Relatives of the Conolly Sequence
- A combinatorial problem solved by a meta-Fibonacci recurrence relation
- On Hofstadter heart sequences
- A new approach to the Hofstadter \(Q\)-recurrence
- Solutions of certain meta-Fibonacci recurrences
- Title not available (Why is that?)
- A combinatorial approach for constructing non-monotonic solutions to the generalized Golomb recursion
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)
