English

A study of a family of self-referential sequences

General Mathematics 2025-08-04 v2

Abstract

We introduce and analyze a three-parameter family of self-referential integer sequences S(x,y,z)S(x,y,z): starting from a(1)=xa(1)=x, each term advances by yy when the index kk has already appeared as a value and by zz otherwise. This simple rule generates a surprising zoo of behaviors, many of which are catalogued - albeit in a rather unstructured fashion - in the OEIS. This family has recently and independently been studied by Fokkink and Joshi, who named them "hiccup sequences" and established their general morphic nature. Our work provides a complementary, in-depth analysis of major subfamilies. Whenever y>z>0y>z>0, we prove that the density a(k)/ka(k)/k converges to the positive root of r2zr(yz)=0r^{2}-zr-(y-z)=0. Two subfamilies, S(x,Z+1,Z)S(x,Z+1,Z) and S(x,Z,Z+1)S(x,Z,Z+1), yield explicit non-homogeneous Beatty sequences, providing explicit formulas for numerous OEIS entries. For y=0y=0 and z2z \ge 2, the sequences eventually become periodic and satisfy linear recurrences. Critical cases with a zero discriminant unveil geometric patterns on triangular, square, and hexagonal lattices. Finally, via tree-like representations we uncover a tight link with meta-Fibonacci recurrences. These results position S(x,y,z)S(x,y,z) as a unifying framework connecting additive combinatorics, number theory, and discrete dynamics.

Keywords

Cite

@article{arxiv.2506.18103,
  title  = {A study of a family of self-referential sequences},
  author = {Benoit Cloitre},
  journal= {arXiv preprint arXiv:2506.18103},
  year   = {2025}
}

Comments

16 pages, 3 figures. This is a revision that integrates the recent theoretical framework on 'hiccup sequences' by Fokkink and Joshi (arXiv:2407.08639). New remarks show how their work provides a rigorous justification for the explicit Beatty sequence formulas presented in this paper. An appendix with a compendium of known hiccup sequences has also been added