Technical note verifies OEIS A395171(11) and establishes bounds for A395171(18), implying significant computational results.
This archive contains a technical note, C++ source code, raw computation logs, a curated interval manifest, and SHA-256 checksums for a computational certification of OEIS A395171(11). The main result is the certification that OEIS A395171(11) = 357913941. The computation verifies gcd(Phi_31(m), m! - 1) = 1 for every integer 2 <= m <= 357913940, and the final production run finds gcd(Phi_31(357913941), 357913941! - 1) = 715827883. The archive also reports computations for OEIS A395171(18), corresponding to p = 61. The m-first computation proves A395171(18) > 100000000. Together with the standard construction from the prime (2^61 + 1)/3, this gives 100000000 < A395171(18) <= 768614336404564649. A q-first search found no witness prime q <= 999999963 for 100000000 < m < 768614336404564649. The raw logs are included as generated and may contain interrupted or partially buffered terminal output. The curated file manifest.csv records the certified intervals used for the proof.
No takes yet. Share an insight, caveat, or question.
Aldo Roberto Pessolano (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: