Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation

DOI10.1016/J.JSC.2017.06.002zbMath1432.11184arXiv1609.06342OpenAlexW2962702767MaRDI QIDQ1690783

Nathan Fox

Publication date: 12 January 2018

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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

zbMATH Keywords

integer sequencesquasipolynomialsrecurrencesnested recursion

Mathematics Subject Classification ID

Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Calculation of integer sequences (11Y55)

Related Items (3)

An exploration of solutions to two related Hofstadter-Huber recurrence relations ⋮ A New Approach to the Hofstadter $Q$-Recurrence ⋮ Connecting slow solutions to nested recurrences with linear recurrent sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A well-behaved cousin of the Hofstadter sequence
• Trees and meta-Fibonacci sequences
• Constructing New Families of Nested Recursions with Slow Solutions
• Quasipolynomial Solutions to the Hofstadter Q-Recurrence
• Nested Recurrence Relations with Conolly-like Solutions
• Conway's Challenge Sequence
• Reducibility among Combinatorial Problems

This page was built for publication: Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation