Perfect powers in the OEIS sequence A113258

We study the factorial-power sum a(n) = sum_{i=1}^n (i!)^((n-i+1)!), recorded as OEIS A113258. Its fourth term is 125 = 5³. We prove that no term with n > 4 is a perfect power with base and exponent greater than one. The proof combines elementary congruences and power-gap estimates, a specialized interpolation-determinant proof of an explicit lower bound for a linear form in two logarithms, and finite arithmetic certificates. The result is formalized in Lean 4, including the correctness of the certificate checkers and coverage of the remaining candidates. The finite checks use native_decide and therefore additionally trust the Lean compiler and runtime. The manuscript documents these dependencies and provides reproduction instructions. The accompanying Lean source and certificates are archived as version 1.0.0 at https://doi.org/10.5281/zenodo.22812208.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-17
DOI
https://doi.org/10.5281/zenodo.22811155
Primary Topic
Polynomial and algebraic computation
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

Perfect powers in the OEIS sequence A113258

YiChuan Zhang
Zenodo (CERN European Organization for Nuclear Research)
Polynomial and algebraic computation
preprint

Perfect powers in the OEIS sequence A113258

YiChuan Zhang
preprint en

Abstract

We study the factorial-power sum a(n) = sum_{i=1}^n (i!)^((n-i+1)!), recorded as OEIS A113258. Its fourth term is 125 = 5³. We prove that no term with n > 4 is a perfect power with base and exponent greater than one. The proof combines elementary congruences and power-gap estimates, a specialized interpolation-determinant proof of an explicit lower bound for a linear form in two logarithms, and finite arithmetic certificates. The result is formalized in Lean 4, including the correctness of the certificate checkers and coverage of the remaining candidates. The finite checks use native_decide and therefore additionally trust the Lean compiler and runtime. The manuscript documents these dependencies and provides reproduction instructions. The accompanying Lean source and certificates are archived as version 1.0.0 at https://doi.org/10.5281/zenodo.22812208.

Zenodo (CERN European Organization for Nuclear Research)
Polynomial and algebraic computation
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.