Suffix-Matching Searches in Iterated Prime- Index Sequences -Theory and Implementation of Rank Iteration, Exact Certification, and Local Prime Counting-
This report extends an earlier study [1] of decimal self-congruences for iterated prime-index maps and describesthe mathematical basis and Python/C++ implementation as of 21 November 2026. For a positive integer n with ddecimal digits, the problem is to find cases in which applying the nth-prime map r times produces a value whosefinal d digits equal n. The cases r = 2, 3, and 4 correspond to OEIS A074978, A343128, and A392376[2]. References:[1] Keiichi Motoi. A Fast Search Algorithm for Decimal Self-Congruences of Iterated Prime-Index Maps — Relation to OEIS A074978, A343128, and A392376. Version 1.0, report dated 22 August 2026; Zenodo deposit, 23 August 2026. DOI: 10.5281/zenodo.22066424. English and Japanese versions; CC BY 4.0.https://zenodo.org/records/24419230 [2] OEIS Foundation. A074978, A343128, A392376, and A343145. Definitions and known terms for fixed-depthself-congruences and minimum suffix-matching inputs by depth.https://oeis.org/A39237
Authors
- Keiichi Motoi (ORCID: https://orcid.org/0000-0002-5219-8085)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24419229
- Primary Topic
- Analytic Number Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00