English

The Behavior of a Three-Term Hofstadter-Like Recurrence with Linear Initial Conditions

Number Theory 2024-06-04 v1 Combinatorics

Abstract

In this paper, we study the three-term nested recurrence relation B(n)=B(nB(n1))+B(nB(n2))+B(nB(n3))B(n)=B(n-B(n-1))+B(n-B(n-2))+B(n-B(n-3)) subject to initial conditions where the first NN terms are the integers 11 through NN. This recurrence is the three-term analog of Hofstadter's famous QQ-recurrence Q(n)=Q(nQ(n1))+Q(nQ(n2))Q(n)=Q(n-Q(n-1))+Q(n-Q(n-2)). Nested recurrences are highly sensitive to their initial conditions. Some initial conditions lead to finite sequences, others lead to predictable sequences, and yet others lead to sequences that appear to be chaotic and infinite. A corresponding study to this one was previously carried out on the QQ-recurrence. As with that work, we consider two families of sequences, one where terms with nonpositive indices are undefined and a second where terms with nonpositive indices are defined to be zero. We find similar results here as with the QQ-recurrence, as we can completely characterize the sequences for sufficiently large NN. The results here are, in a sense, simpler, as our sequences are all finite for sufficiently large NN.

Keywords

Cite

@article{arxiv.2406.00904,
  title  = {The Behavior of a Three-Term Hofstadter-Like Recurrence with Linear Initial Conditions},
  author = {Nathan Fox},
  journal= {arXiv preprint arXiv:2406.00904},
  year   = {2024}
}

Comments

27 pages, 2 figures. For extra computational data, see GitHub: https://github.com/nhf216/B-recurrence-data