CONSECUTIVE CATALAN–NIVEN NUMBERS: SUPERLOGARITHMIC ABUNDANCE OF SIX-TERM RUNS AND A REFUTATION OF ELDAR'S CONJECTURE
A positive integer is Catalan–Niven if its greedy Catalan digit sum divides it.We prove that the counting function L6(X) of starts of six consecutive Catalan–Niven integerssatisfies L6(X) ≫A (log X)A for every fixed A > 0. This follows from a general padding theoremfor distinct consecutive digit-sum profiles satisfying a Chinese remainder compatibility condition.We give explicit five- and six-term witnesses, refuting the conjecture in OEIS A352511, andindependently reproducible exact certificates. An exact nested-carry criterion reduces the seven-term obstruction to a restricted greedy remainder of zero or one. A finite certificate excludesseven terms with final term below C15001 (9,025 decimal digits). The unrestricted seven-termproblem remains open.
Authors
- Tony Newton (ORCID: https://orcid.org/0009-0009-9189-6431)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-19
- DOI
- https://doi.org/10.5281/zenodo.24379243
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint