Claims

../

2025_08_28_van_doorn: Van Doorn's 2025 preprint: f(n) is at most floor(n/4) + d with d in {1, 2, 2, 4} by n mod 4 and at least (1/12 - o(1)) n, with the conjecture that the upper bound is exact; the upper half of the site's resolution.

2026_07_04_cipollini: Cipollini's 2026 preprint, with declared AI assistance, proving the lower bound (1/4 - o(1)) n and so the asymptotic with c = 1/4; the site's resolution, unrefereed, with three outside Lean developments not built here.

2026_07_28_wang_xie_zhao: A 2026 preprint, with declared AI assistance, claiming f(n) = floor(n/4) + d for all sufficiently large n and, with computer checks, for every n at least 4 outside fifteen listed exceptions; a tab claim, unreviewed.

---