{"schema":"vela.problem-packet.v0.1","problem":372,"statement":"Let $P(n)$ denote the largest prime factor of $n$. There are infinitely many $n$ such that $P(n)&#62;P(n+1)&#62;P(n+2)$.","status":"solved","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A071870","name":"Numbers k such that gpf(k) > gpf(k+1) > gpf(k+2) where gpf(k) denotes the largest prime factor of k.","terms":"13,14,34,37,38,43,61,62,73,79,86,94,103,118,122,123,142,151,152,157,158,163,173,185,193,194,202,206,214,218,223,229,241,","url":"https://oeis.org/A071870"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}