Connecting slow solutions to nested recurrences with linear recurrent sequences

DOI10.1080/10236198.2022.2152335zbMath1506.11021arXiv2203.09340OpenAlexW4311623231MaRDI QIDQ5870247

Nathan Fox

Publication date: 6 January 2023

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.09340

zbMATH Keywords

treeFibonacciZeckendorf representationHofstadter sequenceslowly growing solutionnested recurrence

Mathematics Subject Classification ID

Trees (05C05) Number-theoretic algorithms; complexity (11Y16) Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nested recursions, simultaneous parameters and tree superpositions
• From Fibonacci numbers to central limit type theorems
• A well-behaved cousin of the Hofstadter sequence
• Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation
• Trees and meta-Fibonacci sequences
• Solving non-homogeneous nested recursions using trees
• Constructing New Families of Nested Recursions with Slow Solutions
• Quasipolynomial Solutions to the Hofstadter Q-Recurrence
• Nested recursions with ceiling function solutions
• Nested Recurrence Relations with Conolly-like Solutions
• Conway's Challenge Sequence
• A combinatorial approach for solving certain nested recursions with non-slow solutions
• Linear recurrent subsequences of generalized meta-Fibonacci sequences
• A New Approach to the Hofstadter $Q$-Recurrence
• A Slow Relative of Hofstadter's Q-Sequence
• A combinatorial approach for constructing non-monotonic solutions to the generalized Golomb recursion

This page was built for publication: Connecting slow solutions to nested recurrences with linear recurrent sequences