{"schema":"vela.problem-packet.v0.1","problem":1095,"statement":"Let $g(k)>k+1$ be the smallest $n$ such that all prime factors of $\\binom{n}{k}$ are $>k$. Estimate $g(k)$.","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A003458","name":"Erdős-Selfridge function: a(n) is the least number m > n+1 such that the least prime factor of binomial(m, n) is > n.","terms":"3,6,7,7,23,62,143,44,159,46,47,174,2239,239,719,241,5849,2098,2099,43196,14871,19574,35423,193049,2105,36287,1119,284,24","url":"https://oeis.org/A003458"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}