{"schema":"vela.problem-packet.v0.1","problem":1063,"statement":"Let $k\\geq 2$ and define $n_k\\geq 2k$ to be the least value of $n$ such that $n-i$ divides $\\binom{n}{k}$ for all but one $0\\leq i&#60;k$. Estimate $n_k$.","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A389360","name":"Smallest m >= 2*n such that binomial(m,n) is a multiple of m-i for all 0<=i<n, but one.","terms":"4,6,9,12,75,30,70,56,2403,280,3465,210,793,4732,3213,1456,31110,612,67203,145540,464646,2640,476938,21000,86550,234026,1","url":"https://oeis.org/A389360"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}