{"schema":"vela.problem-packet.v0.1","problem":411,"statement":"Let $g_1=g(n)=n+\\phi(n)$ and $g_k(n)=g(g_{k-1}(n))$. For which $n$ and $r$ is it true that $g_{k+r}(n)=2g_k(n)$ for all large $k$?","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A383044","name":"Numbers m such that phi(m) + phi(m+phi(m)) = m where phi is the Euler totient function.","terms":"4,6,8,10,12,14,16,20,24,28,32,40,48,56,64,70,80,94,96,112,128,140,160,188,192,224,256,280,320,376,384,448,512,560,640,75","url":"https://oeis.org/A383044"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}