{"schema":"vela.problem-packet.v0.1","problem":932,"statement":"Let $p_k$ denote the $k$th prime. For infinitely many $r$ there are at least two integers $p_r<n<p_{r+1}$ all of whose prime factors are $<p_{r+1}-p_r$.","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A387864","name":"Numbers r for which there are at least two integers strictly between prime(r) and prime(r+1), all of whose prime factors are less than prime(r+1) - prime(r).","terms":"4,9,11,15,24,30,34,37,46,47,53,62,66,92,99,114,137,146,150,154,168,172,180,189,205,217,242,259,263,274,278,283,293,295,3","url":"https://oeis.org/A387864"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}