{"schema":"vela.problem-packet.v0.1","problem":648,"statement":"Let $g(n)$ denote the largest $t$ such that there exist integers $2\\leq a_1<a_2<\\cdots <a_t <n$ such that\\[P(a_1)>P(a_2)&#62;\\cdots &#62;P(a_t)\\]where $P(m)$ is the greatest prime factor of $m$. Estimate $g(n)$.","status":"solved","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A391750","name":"Maximum length of an increasing sequence, bounded by n, in which the largest prime divisors of the elements form a decreasing sequence.","terms":"1,1,2,2,2,2,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,7,7,7,7,7,7,7,7,","url":"https://oeis.org/A391750"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}