Trees and meta-Fibonacci sequences
From MaRDI portal
Publication:2380294
zbMath1188.05011MaRDI QIDQ2380294
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
Trees (05C05) Exact enumeration problems, generating functions (05A15) Recurrences (11B37) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items (11)
Nested recursions, simultaneous parameters and tree superpositions ⋮ Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation ⋮ On Hofstadter heart sequences ⋮ Solving non-homogeneous nested recursions using trees ⋮ 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 ⋮ Constructing New Families of Nested Recursions with Slow Solutions ⋮ Connecting slow solutions to nested recurrences with linear recurrent sequences
This page was built for publication: Trees and meta-Fibonacci sequences
