Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_07_15_snyder: Snyder claims both answers are yes: the sum of t_2(n) up to x is at most a constant times x^2 / (log x)^(1/2048), and the sum of t_(k+1) is little-o of the sum of t_k for every fixed k at least 2, proved in Lean 4 with Mathlib.
Linked from (1)
Graph