{"schema":"vela.problem-packet.v0.1","problem":385,"statement":"Let\\[F(n) = \\max_{\\substack{m<n\\\\ m\\textrm{ composite}}} m+p(m),\\]where $p(m)$ is the least prime divisor of $m$. Is it true that $F(n)>n$ for all sufficiently large $n$? Does $F(n)-n\\to \\infty$ as $n\\to\\infty$?","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A322292","name":"a(n) = Max_{c composite, c < n} (c + least prime factor of c).","terms":"6,6,8,8,10,12,12,12,14,14,16,18,18,18,20,20,22,24,24,24,26,30,30,30,30,30,32,32,34,36,36,40,40,40,40,42,42,42,44,44,46,4","url":"https://oeis.org/A322292"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}