Answers are grounded in this paper and cite their sources.
Let \(p_n\) denote the \(n\)-th prime and define \(X_n= np_n/n\). OEIS A333138 records a sequence obtained by parsing consecutive nondecreasing blocks of \((X_n)\) according to the convention implemented in the OEIS generator. This paper proves two qualitative properties of that parsed sequence \((b_k)\). First, for every fixed integer \(r≥1\), there are infinitely many indices \(k\) such that \(b_k≥ r\). Second, for every fixed integer \(K≥1\), the word \(1^K\) occurs infinitely often in \((b_k)\). Consequently,\[k→∞ b_k=1, k→∞ b_k=∞.\]The proof is based on an exact threshold relating the local behavior of \(np_n/n\) to consecutive prime gaps, together with floor-safe estimates, the large consecutive prime-gap theorem of Ford–Maynard–Tao, and Maynard’s bounded-diameter prime-cluster results. The paper also formalizes the parsing rule used by OEIS A333138 and provides exact finite verification material in the accompanying supplementary archive.As a concrete finite illustration beyond the currently listed OEIS prefix, the supplementary verifier proves exactly that \(b₅₂₀=10\), with parser start \(s₅₂₀=1598\).
No takes yet. Share an insight, caveat, or question.
Lien-Hung Su (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: