Spot-based generations for meta-Fibonacci sequences
From MaRDI portal
Abstract: For many meta-Fibonacci sequences it is possible to identify a partition of the sequence into successive intervals (sometimes called blocks) with the property that the sequence behaves "similarly" in each block. This partition provides insights into the sequence properties. To date, for any given sequence, only ad hoc methods have been available to identify this partition. We apply a new concept - the spot-based generation sequence - to derive a general methodology for identifying this partition for a large class of meta-Fibonacci sequences. This class includes the Conolly and Conway sequences and many of their well-behaved variants, and even some highly chaotic sequences, such as Hofstadter's famous Q-sequence.
Recommendations
Cites work
Cited in
(11)- On some properties of the Hofstadter-Mertens function
- On some properties of a meta-Fibonacci sequence connected to Hofstadter sequence and Möbius function
- On a conjecture about generalized \(Q\)-recurrence
- On a generalization of Hofstadter's Q-sequence: a family of chaotic generational structures
- A variant of Hofstadter's sequence and finite automata
- The behavior of a three-term Hofstadter-like recurrence with linear initial conditions
- On the solution space of the Golomb recursion
- Constructing new families of nested recursions with slow solutions
- On Hofstadter heart sequences
- An exploration of solutions to two related Hofstadter-Huber recurrence relations
- A combinatorial approach for constructing non-monotonic solutions to the generalized Golomb recursion
This page was built for publication: Spot-based generations for meta-Fibonacci sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4915377)