Pith. sign in

REVIEW 4 major objections 3 minor 10 references

A study of a family of self-referential sequences

T0 review · 4 major / 3 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper establishes that every sequence in the three-parameter hit-or-miss family S(x,y,z) with y>z>0 grows linearly with slope r0, the positive root of r^2 - z r - (y-z)=0, and that two subfamilies are exactly Beatty sequences with…

desk verdict The headline density theorem is false on a whole subfamily (S(1,2,1) is the identity), so the paper cannot stand as-is; it does contain a few correct elementary pieces. read the letter →

arxiv 2506.18103 v2 pith:LIVWXWB4 submitted 2025-06-22 math.GM

Benoit Cloitre This is my paper · ORCID
classification math.GM MSC 11B8368R1505A15
keywords self-referentialsequenceshit-or-misshiccupBeattymorphicmeta-Fibonaccirecurrenceslatticecombinatoricsasymptoticdensity
topics The Collatz Conjecture
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper studies a three-parameter family of self-referential integer sequences defined by a hit-or-miss rule: start with a(1)=x, and at each later index add y if that index has already appeared as a value, otherwise add z. Its central result is that whenever y>z>0, the sequence grows linearly with slope r0, the positive root of $r^2 - z r - (y-z)=0$, so the asymptotic density is completely determined by the two increments. Two subfamilies, $S(x,Z+1,Z)$ and $S(x,Z,Z+1)$, are shown to be non-homogeneous Beatty sequences with explicit closed forms $\lfloor r n - \gamma \rfloor$ for every starting value, including the quasi-homogeneous case $a(n)=\lceil n r \rceil$ when $x=Z+1$. Additional results cover the $y=0$ case via periodic increments and linear recurrences, discriminant-zero cases with triangular, square, and hexagonal lattice interpretations, and a bridge to meta-Fibonacci recurrences through leaf counts in forests of complete $k$-ary trees.

What carries the argument

The central machinery is the hit/miss counting relation combined with the counting function $N(t)=\max\{k:a(k)\le t\}$. Lemma 2.2 states a general duality: if a strictly increasing sequence grows at rate $r$ in the sense of limsup/liminf, then its counting function grows at the reciprocal rates, and this turns the exact identity $a(n)=x+z(n-1)+(y-z)H_n$ into the equilibrium equation $r=z+(y-z)/r$, whose positive solution is $r_0$. An alternative derivation notes that the same root appears as the Perron-Frobenius eigenvalue of the generating morphism's adjacency matrix. For the Beatty results, the load-bearing tool is Rayleigh-Beatty complementarity between $\lceil n r \rceil$ and $\lfloor n s \rfloor$ with $1/r+1/s=1$: the size of the increment, the larger value $y$ or the smaller value $z$, is exactly determined by whether the index lies in the sequence's image.

What would settle it

Compute $S(1,2,1)$: the rule gives $a(1)=1$ and, since no index is ever a hit, $a(n)=n$ for all $n$, so $a(n)/n=1$ while Theorem 2.1 predicts $(1+\sqrt{5})/2\approx 1.618$; this one sequence settles whether the theorem needs the extra condition that values appear before they are tested.

Watch

Extended reading notes

Core claim

The central discovery is that a simple self-referential rule, "add y if the index has already appeared as a value, otherwise add z," generates sequences whose asymptotic and exact structure are governed by one quadratic equation. The paper proves that for $y>z>0$ the limit $\lim_{n\to\infty} a(n)/n$ exists and equals $r_0$, the positive root of $r^2-z r-(y-z)=0$, by combining the exact relation $a(n)=x+z(n-1)+(y-z)H_n$, where $H_n$ counts hits, with a duality lemma relating limsup and liminf of the sequence to those of its counting function. It then proves that the families $S(x,Z+1,Z)$ and $S(x,Z,Z+1)$ are Beatty sequences with slopes $r_A=(Z+\sqrt{Z^2+4})/2$ and $r_B=(Z+1+\sqrt{Z^2+2Z-3})/2$, and gives explicit offsets for every starting value; for $x=Z+1$ the closed form is simply $a(n)=\lceil n r \rceil$. The paper also establishes that $y=0$, $z\ge 2$ yields eventually periodic increments with period $z$ and the linear recurrence $a(k)-a(k-1)-a(k-z)+a(k-z-1)=0$, and that discriminant-zero cases correspond to lattice counting problems on triangular, square, and hexagonal grids. Finally, it shows that $S(k+1,1,k+1)=n+k\,a_{0,k}(n)$, where $a_{0,k}(n)$ counts leaves in a forest of complete $k$-ary trees with $n$ nodes, tying the hit/miss rule to meta-Fibonacci recurrences.

Load-bearing premise

The proof assumes that every number produced by the sequence has been produced earlier when it is checked as an index, so being in the image is the same as being a hit; if a value first appears exactly when it is tested, the central density statement can fail.

Editorial extensions

If this is right

  • For every $y>z>0$, the sequence is asymptotically linear with slope $r_0$, so the counting function satisfies $N(n)\sim n/r_0$ and the density of hits converges to $(r_0-z)/(y-z)$.
  • The two Beatty families give immediate closed-form computations $\lfloor r n-\gamma\rfloor$ for all starting values, so any catalogued sequence in these families can be generated without simulating the recurrence.
  • When $y=0$ and $z\ge 2$, the increments are eventually periodic with period $z$, giving slope $z-1$ and the linear recurrence $a(k)-a(k-1)-a(k-z)+a(k-z-1)=0$.
  • The discriminant-zero sequences $S(3,1,2)$, $S(4,1,2)$, and $S(5,1,2)$ provide explicit formulas for Ramsey core numbers, a square-spiral covering count, and a hexagonal lattice structure, respectively.
  • The identity $S(k+1,1,k+1)=n+k\,a_{0,k}(n)$ links the hit/miss rule to the number of leaves in forests of complete $k$-ary trees, so questions about these recurrences can be translated into tree-enumeration problems.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The density theorem as stated needs a small extra hypothesis: every value must be attained before it is tested as an index. Without it, $S(1,2,1)$ gives $a(n)=n$ and density $1$, not the predicted golden ratio, so the theorem is best read as a statement about non-permutation cases.
  • The explicit offsets in the Beatty formulas suggest a uniform Rayleigh-Beatty proof for all starting values $x$ in the two families, which would make the closed forms follow from a single complementarity argument rather than case-by-case verification.
  • The same counting-function duality used here could be applied to related self-referential families, such as the four-parameter variant where membership is tested against a shifting window, to obtain analogues of the density root.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 3 minor

Summary. The manuscript studies the three-parameter family of self-referential sequences S(x,y,z) defined by a(1)=x and, for k>1, a(k)=a(k-1)+y if k belongs to {a(1),...,a(k-1)} (a hit) and a(k)=a(k-1)+z otherwise (a miss). The paper claims that for y>z>0 the ratio a(n)/n converges to the positive root of r^2 - z r - (y-z)=0 (Theorem 2.1); that the subfamilies S(x,Z+1,Z) and S(x,Z,Z+1) are non-homogeneous Beatty sequences for every starting value x (Propositions 3.1 and 3.3); that the case y=0, z>=2 leads to ultimately periodic increments and a linear recurrence (Theorem 4.1); that several discriminant-zero cases have explicit closed forms with triangular, square, and hexagonal lattice interpretations (Section 5); and that there are formal connections to meta-Fibonacci recurrences (Section 6). The paper also contains an OEIS compendium and explicitly positions itself as complementary to the morphic-sequence framework of Fokkink and Joshi.

Significance. If the central results were correct, the paper would provide a useful analytic complement to the morphic characterization of hiccup sequences and a unified explanation for many OEIS entries. The author is to be credited for recognizing the connection to Fokkink and Joshi and for assembling a systematic OEIS catalogue. However, the main asymptotic theorem and the general Beatty propositions are false as stated, and the closed-form claims in Section 5 rest on unproved assertions. The special case x=Z+1 in Section 3 is plausible and may contain a kernel of a correct theorem, but the manuscript as it stands does not deliver reliable new results.

major comments (4)
  1. [Section 2, Theorem 2.1] Theorem 2.1 is false for z=1. For S(1,2,1), an immediate induction gives a(n)=n, so a(n)/n tends to 1, whereas the claimed limit is the positive root of r^2 - r - 1 = 0, namely (1+sqrt(5))/2. In fact S(1,y,1) is the identity sequence for every y>=2. The error is in Step 2 of the proof: the 'Key property' states that k in A_{k-1} iff k is in the image of the sequence, i.e., iff there exists j<k with a(j)=k. That equivalence is false when every preimage of k occurs at an index at least k. In the counterexample, each k is in the image because a(k)=k, but it is never a hit, so H_n=0 while N(n)=n; the asserted identity H_n=N(n)+O(1) is off by n. The proof therefore does not establish the stated range y>z>0. The paper's own remark restricting the morphic eigenvalue argument to y>1 and z>1 is consistent with this failure, and the theorem would at minimum need a condition such as z>=2 or an additional argument controlling the first preimage of k.
  2. [Section 3.1, Proposition 3.1] Proposition 3.1 gives false formulas for the stated starting values. For Z=2 and x=1, the proposition says a(n)=floor(r_A n - 2(r_A-1)/(r_A+1)) with r_A=1+sqrt(2). The definition of S(1,3,2) gives a(1)=1 and a(2)=3, since 2 is not in {1}. The proposed formula gives floor(r_A - 2(r_A-1)/(r_A+1))=1 but floor(2r_A - 2(r_A-1)/(r_A+1))=4, not 3. The same type of failure occurs in Proposition 3.3: for Z=2 and x=1, the formula reduces to a(n)=floor(r_B n) with r_B=(3+sqrt(5))/2, so it gives a(2)=5, whereas S(1,2,3) has a(2)=4. The 'Theoretical Justification' after Proposition 3.1 explains the offset as being determined by the initial condition a(1)=x, but infinitely many offsets satisfy floor(r_A-gamma)=x, and the paper does not verify that the chosen offset produces a sequence whose image and increments match the self-referential rule at every index.
  3. [Sections 3.1 and 3.2, general Beatty claims] The general Beatty propositions are not proved for all x, and the constructive proofs do not cover the stated generality. The paper invokes Fokkink and Joshi's Theorem 15 to assert existence of a Beatty form for x<=Z, but the explicit formulas in Propositions 3.1 and 3.3 are claimed for all x, including x>Z, where no existence theorem is cited. The special-case proofs of Theorems 3.2 and 3.4 handle only x=Z+1 and, as written, assert that a 'hit' is equivalent to the larger increment for a Beatty sequence without proving that the specific image of the sequence has the required complementarity with respect to the index set. Establishing that equivalence is the core of the argument and cannot be replaced by a reference to the Beatty-Rayleigh theorem without checking the complementary pair.
  4. [Section 5, Theorems 5.1-5.3] The Section 5 closed-form results are not backed by complete proofs. Theorem 5.3 explicitly says 'A full algebraic proof showing that this closed form satisfies the S(5,1,2) recurrence is technical and omitted for brevity,' and the claimed correspondence between misses and hexagonal layers is justified only by a figure and an intuitive description. In the proof of Theorem 5.2, the key equivalence is asserted with 'This equivalence can be established by showing...' but no demonstration follows. In Theorem 5.1, the set of integers avoided by f(n) is invoked as 'a known property' with no reference. Because these equivalences are load-bearing for the advertised lattice connections, the theorems are unsupported as stated.
minor comments (3)
  1. [Section 2 and Lemma 2.2] The notation for the limsup and liminf of a(n)/n is visually ambiguous: both are rendered with the same letter r, and the reader must infer which is which from context. A distinct notation such as r and r, or r^* and r_*, would improve readability.
  2. [Section 3, Propositions 3.1 and 3.3] The propositions state cases for x=0, but Definition 1.1 takes x in N, and it is not stated whether N includes 0; if it does, the case x=0 should specify how a(1)=0 is handled in the self-referential rule for k=2.
  3. [Section 5.3] The definition of the layer parameter m in Theorem 5.3 uses a ceiling expression with a repeated radical, but no derivation or estimate is given to show that the displayed closed form is well-defined for all n.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; the paper's derivation is self-contained, and the most serious defect (Theorem 2.1) is a false step rather than a circular one.

full rationale

The central asymptotic argument in Section 2 (Theorem 2.1) is built from the exact relation a(n)=x+z(n-1)+(y-z)H_n, the counting-function duality lemma, and a limsup/liminf system; it does not import its conclusion as an assumption. The 'Key property' in Step 2 is a definitional characterization of A_{k-1}; the subsequent assertion H_n=N(n)+O(1) is an identity claim that happens to be false for S(1,2,1), where H_n=0 and N(n)=n. A false equality is a correctness error, not a circular reduction: the proof would be valid if the equality were true. The Beatty propositions (3.1 and 3.3) are justified by an external theorem of Fokkink and Joshi for the existence of the Beatty form, with the slope fixed by a morphism eigenvalue and the offset fixed by a(1); fitting the offset to the initial condition is an incomplete proof for parameters outside the cited theorem's range, but it is not a prediction statistically forced by fitted data. The self-citation [5] is historical and does not carry any load-bearing premise. Sections 4, 5, and 6 rely on elementary inductions or on explicitly cited external results (Ruskey-Deugau, OEIS, Fokkink-Joshi), not on self-referential definitional equivalences. The acknowledged omitted proof in Section 5.3 is a completeness gap, not circularity. No circular step can be exhibited with a quote and a reduction, so the circularity score is 0.

Assumptions & free parameters 2 free parameters · 5 assumptions · 0 invented entities

The central proof in Theorem 2.1 relies on a false 'key property' that equates image membership with prior occurrence; the Beatty formulas fit an offset to the initial value; Theorem 5.3 imports a layer parameter without proof; the paper also leans on Fokkink and Joshi's morphic framework and Ruskey-Deugau's theorem for its main bridges. No new entities such as particles or forces are introduced, and the lattice and tree diagrams are visualizations rather than new postulates.

free parameters (2)
  • Beatty offset gamma = case-dependent expressions in Propositions 3.1 and 3.3
    The offset is chosen so that a(1)=x, not derived from the recurrence for all n. The paper verifies this only for x=Z+1; direct evaluation shows mismatches for (x,Z)=(1,2), (2,2), and (4,2).
  • Hexagonal layer parameter m = ceil((-1+sqrt(1+8n/3))/2)
    Introduced in Theorem 5.3 to encode hexagonal layers; the proof that this closed form satisfies the recurrence is omitted, making m an ad hoc construction for the claimed formula.
assumptions (5)
  • ad hoc to paper The 'Key property' in Theorem 2.1: k is in A_{k-1} if and only if k is in the image of the sequence
    Assumed in Section 2, Step 2. It fails when k is attained only at index k, as in S(1,2,1), and this false premise drives the density theorem.
  • ad hoc to paper The set of integers avoided by f(n)=n+floor((sqrt(8n-7)+3)/2) is exactly {k(k-1)/2+1 : k>=2}
    Lemma used in Theorem 5.1's proof as 'a known property', with no citation or derivation given.
  • standard math Beatty-Rayleigh complementary sequence theorem
    Used in the x=Z+1 proofs (Theorems 3.2 and 3.4) to map hits and misses to large and small increments.
  • domain assumption Fokkink and Joshi's theorems: all hiccup sequences are morphic; Beatty form holds for x<=z and |y-z|=1
    Invoked in Section 3 remarks to justify the existence of the Beatty forms in Propositions 3.1 and 3.3.
  • domain assumption Ruskey and Deugau's k-ary tree theorem
    Quoted in Section 6.1 (Theorem 6.1) without proof; used to assert S(k+1,1,k+1)=n+k*a_{0,k}(n).

how reviews work

0 comments
Cite this review

Pith. "Pith review of A study of a family of self-referential sequences." pith.science (2026). https://pith.science/paper/LIVWXWB4

@misc{pith2026250618103,
  author       = {Pith},
  title        = {Pith review of: A study of a family of self-referential sequences},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/LIVWXWB4}},
  note         = {Machine review of arXiv:2506.18103}
}
abstract

We introduce and analyze a three-parameter family of self-referential integer sequences $S(x,y,z)$: starting from $a(1)=x$, each term advances by $y$ when the index $k$ has already appeared as a value and by $z$ 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>0$, we prove that the density $a(k)/k$ converges to the positive root of $r^{2}-zr-(y-z)=0$. Two subfamilies, $S(x,Z+1,Z)$ and $S(x,Z,Z+1)$, yield explicit non-homogeneous Beatty sequences, providing explicit formulas for numerous OEIS entries. For $y=0$ and $z \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)$ as a unifying framework connecting additive combinatorics, number theory, and discrete dynamics.

Figures

Figures reproduced from arXiv: 2506.18103 by the authors.

Figure 1
Figure 1. Triangular grid interpretation of S(3, 1, 2) 5.2 The sequence S(4, 1, 2) (OEIS A217334) This sequence, also corresponding to a vanishing discriminant case, has a powerful combinatorial interpretation related to covering a grid with squares. Theorem 5.2: Thumbtack sequence The sequence S(4, 1, 2) has the closed form a(n) = n + ⌊ √ 4n − 3⌋ + 2. Combinatorially, it represents the minimum number of vertices required to … view at source ↗
Figure 2
Figure 2. Spiral covering interpretation of S(4, 1, 2). 5.3 The sequence S(5, 1, 2) (OEIS A080353) This case reveals a surprisingly deep and elegant connection to hexagonal lattices. While its closed form is complex, it precisely captures the recursive "hit/miss" dynamic. Theorem 5.3: Hexagonal lattice sequence The sequence S(5, 1, 2) is given by the closed form: a(n) = n + 3m + 1 + $ n − 1 − 3m(m−1) 2 m % , where the paramet… view at source ↗
Figure 3
Figure 3. Structure of the hexagonal "snowflake" generated by [PITH_FULL_IMAGE:figures/full_fig_p013_3.png] view at source ↗

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

10 extracted references · 9 canonical work pages

  1. [1]

    Allouche and J

    J.-P. Allouche and J. Shallit, Automatic Sequences: Theory, Applications, Generalizations . Cambridge University Press, 2003

    work page 2003

  2. [2]

    Regularization in Spider-Style Strategy Discovery and Schedule Construction,

    F. Bártek, K. Chvalovský, and M. Suda, “Regularization in Spider-Style Strategy Discovery and Schedule Construction,” in: C. Benzmüller et al. (Eds.),IJCAR 2024, LNAI, vol. 14739, pp. 194–213. Springer (2024)

    work page 2024

  3. [3]

    Beatty, Problem 3173,Amer

    S. Beatty, Problem 3173,Amer. Math. Monthly , 33 (1926), 159; solutions,34 (1927), 159

    work page 1926

  4. [4]

    A remarkable sequence of integers,

    W. Bosma, F. M. Dekking, and W. Steiner, “A remarkable sequence of integers,”J. Integer Seq., 21 (2018), Article 18.7.4

    work page 2018

  5. [5]

    Numerical analogues of Aronson’s se- quence,

    B. Cloitre, N. J. A. Sloane, and M. J. Vandermast, “Numerical analogues of Aronson’s se- quence,” J. Integer Seq., 6 (2003), Article 03.2.2

    work page 2003

  6. [6]

    Ramsey numbers and pseudo-random graphs,

    G. Exoo, “Ramsey numbers and pseudo-random graphs,”Discrete Math., 92 (1991), 99–107

    work page 1991

  7. [7]

    On Cloitre’s hiccup sequences,

    R. Fokkink and G. Joshi, "On Cloitre’s hiccup sequences," arXiv:2407.08639 (2024)

    arXiv 2024

  8. [8]

    Spiral covering designs and lower bounds,

    J. S. Myers, “Spiral covering designs and lower bounds,”J. Combin. Theory Ser. A ,117 (2010), 1127–1135

    work page 2010

Show all 10 references
  1. [9]

    OEIS Foundation Inc.,The On-Line Encyclopedia of Integer Sequences , https://oeis.org

  2. [10]

    The combinatorics of certain k-ary meta-Fibonacci sequences,

    F. Ruskey and C. Deugau, “The combinatorics of certain k-ary meta-Fibonacci sequences,”J. Integer Seq., 12 (2009), Article 09.4.3. A OEIS Compendium of Hiccup Sequences The following table, adapted and extended from the work of Fokkink and Joshi, provides a compre- hensive sum...

    2009

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.