Papers › First occurrences of square-free gaps and an algorithm for their computation
First occurrences of square-free gaps and an algorithm for their computation
Louis Marmet
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper reports the results of a search for first occurrences of square-free gaps using an algorithm based on the sieve of Eratosthenes. Using Qgap(L) to denote the starting number of the first gap having exactly the length L, the following values were found since August 1999: Qgap(10)=262315467, Qgap(12)=47255689915, Qgap(13)=82462576220, Qgap(14)=1043460553364, Qgap(15)=79180770078548, Qgap(16)=3215226335143218, Qgap(17)=23742453640900972 and Qgap(18)=125781000834058568. No gaps longer than 18 were found up to N=125870000000000000.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections