Let me look at that formula and see if there is a good way to translate between it and my problem (essential solutions, not including sign and ordering).
Since this formula applies only for squarefrees, how do I solve r_3(n * s^2)?
Is there a good upper bound on the number of representations? Even a weak one like r_3(n) < n would be nice.
Last fiddled with by CRGreathouse on 20091106 at 14:55
