{"schema":"vela.problem-packet.v0.1","problem":961,"statement":"Let $f(k)$ be the minimal $n$ such that every set of $n$ consecutive integers $>k$ contains an integer divisible by a prime $>k$. Estimate $f(k)$.","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A213253","name":"a(n) = smallest k such that highest prime factor of m(m+1)...(m+k-1) is > n if m > n.","terms":"1,2,3,3,4,4,4,4,4,4,4,4,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,7,7,7,7,7,7,8,8,8,8,8,8,8,8,8,8,8,8,9,9,","url":"https://oeis.org/A213253"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}