{"schema":"vela.problem-packet.v0.1","problem":407,"statement":"Let $w(n)$ count the number of solutions to\\[n=2^a+3^b+2^c3^d\\]with $a,b,c,d\\geq 0$ integers. Is it true that $w(n)$ is bounded by some absolute constant?","status":"solved","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A387688","name":"Number of solutions to n = 2^r + 3^s + 2^t * 3^u where r, s, t and u are nonnegative integers.","terms":"0,0,1,2,3,5,4,5,4,4,7,6,8,7,6,4,6,5,8,7,8,4,8,0,6,5,6,4,10,3,7,5,6,7,9,6,12,6,6,4,10,3,9,7,6,4,8,0,8,2,6,4,8,0,5,2,5,3,8","url":"https://oeis.org/A387688"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}