Consecutive Catalan–niven Numbers: Superlogarithmic Abundance of Six-term Runs and a Refutation of Eldar's Conjecture
Year: 2026
Type: preprint
Abstract: 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.
Author: Newton, Tony
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Keywords: digit sums, consecutive integers, counterexample
Open Access status: green
OpenAlex ID: W7236636766
