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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

CONSECUTIVE CATALAN–NIVEN NUMBERS: SUPERLOGARITHMIC ABUNDANCE OF SIX-TERM RUNS AND A REFUTATION OF ELDAR'S CONJECTURE

Tony Newton
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

CONSECUTIVE CATALAN–NIVEN NUMBERS: SUPERLOGARITHMIC ABUNDANCE OF SIX-TERM RUNS AND A REFUTATION OF ELDAR'S CONJECTURE

Tony Newton
preprint en

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.

Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon