Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x + y - z a cube of an integer, where x,y,z,w are nonnegative integers with x >= y <= z and x == y (mod 2).
Conjecture: (i) a(n) > 0 for all n = 0,1,2,.... Also, any nonnegative integer can be written as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers and x <= y <= z such that x + y - z is a cube of an integer.
(ii) Any nonnegative integer can be written as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers such that P(x,y,z,w) is a cube of an integer, whenever P(x,y,z,w) is among the following polynomials: 2x-y, 4(2x-y), 4(x+y-z), 2x+y-z, 2*(2x+y-z), 4(2x+y-z), x+2y-2z, 4(x+2y-2z), x+3y-3z, 4(x+3y-3z), 2x+3y-3z, 2(2x+3y-3z), 4(2x+3y-3z), x+5y-5z, 4(x+5y-5z), 2x+4y-10z, 4x+8y-20z, 2x+y-z-w, 4(2x+y-z-w), 4x+y-2z-w, 2(4x+y-2z-w), 4(4x+y-2z-w).
The author has proved that each n = 0,1,2,... can be written as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers such that x (or 4x) is a cube.