A283170 -id:A283170 - cp's OEIS frontend

A283196 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with 2x + y and 2x + z both squares, where x,y,z are integers with |y| <= |z|, and w is a positive integer.

1, 1, 1, 2, 2, 1, 3, 1, 1, 8, 1, 1, 6, 1, 3, 1, 3, 9, 2, 3, 3, 4, 4, 1, 7, 5, 2, 4, 3, 3, 6, 1, 5, 7, 1, 5, 4, 6, 4, 3, 2, 8, 3, 2, 11, 2, 6, 1, 6, 5, 1, 9, 4, 7, 11, 1, 3, 16, 1, 2, 5, 3, 14, 2, 7, 7, 4, 6, 3, 12, 6, 3, 8, 5, 2, 3, 5, 5, 9, 2

Offset: 1

Zhi-Wei Sun, Mar 02 2017

nonn

Conjecture: (i) a(n) > 0 for all n > 0.
(ii) Any positive integer n can be written as x^2 + y^2 + z^2 + w^2 such that both x + y and x + 2*z are squares, where x,y,z,w are integers with x >= 0 and w > 0.
(iii)  Any nonnegative integer can be written as x^2 + y^2 + z^2 + w^2 with 2*x + 2*y and 2*x + z both squares, where x,y,z,w are integers with x*y <= 0.
(iv) Each n = 0,1,2,... can be written as x^2 + y^2 + z^2 + w^2 with 2*|x-y| and 2*x + z both squares, where x,y,z,w are integers with x >= 0 and y >= 0.
By the linked JNT paper, any nonnegative integer n can be written as x^2 + y^2 + z^2 + w^2 with x,y,z,w integers such that 2*x + y is a square, and also we can write n as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers such that x - y (or 2*x - 2*y) is a square.

			a(2) = 1 since 2 = 0^2 + 0^2 + 1^2 + 1^2 with 2*0 + 0 = 0^2 and 2*0 + 1 = 1^2.
a(14) = 1 since 14 = 2^2 + 0^2 + (-3)^2 + 1^2 with 2*2 + 0 = 2^2 and 2*2 + (-3) = 1^2.
a(59) = 1 since 59 = 3^2 + 3^2 + (-5)^2 + 4^2 with 2*3 + 3 = 3^2 and 2*3 + (-5) = 1^2.
a(88) = 1 since 88 = (-2)^2 + 4^2 + 8^2 + 2^2 with 2*(-2) + 4 = 0^2 and 2*(-2) + 8 = 2^2.
a(131) = 1 since 131 = 0^2 + 1^2 + 9^2 + 7^2 with 2*0 + 1 = 1^2 and 2*0 + 9 = 3^2.
a(219) = 1 since 219 = 8^2 + (-7)^2 + 9^2 + 5^2 with 2*8 + (-7) = 3^2 and 2*8 + 9 = 5^2.
a(249) = 1 since 249 = (-4)^2 + 8^2 + 12^2 + 5^2 with 2*(-4) + 8 = 0^2 and 2*(-4) + 12 = 2^2.
a(312) = 1 since 312 = 6^2 + 4^2 + (-8)^2 + 14^2 with 2*6 + 4 = 4^2 and 2*6 + (-8) = 2^2.
a(323) = 1 since 323 = 9^2 + 7^2 + 7^2 + 12^2 with 2*9 + 7 = 5^2.
a(536) = 1 since 536 = (-6)^2 + 12^2 + 16^2 + 10^2 with 2*(-6) + 12 = 0^2 and 2*(-6) + 16 = 2^2.
a(888) = 1 since 888 = 14^2 + 8^2 + (-12)^2 + 22^2 with 2*14 + 8 = 6^2 and 2*14 + (-12) = 4^2.
a(1464) = 1 since 1464 = 2^2 + 0^2 + (-4)^2 + 38^2 with 2*2 + 0 = 2^2 and 2*2 + (-4) = 0^2.
a(4152) = 1 since 4152 = 30^2 + 4^2 + (-56)^2 + 10^2 with 2*30 + 4 = 8^2 and 2*30 + (-56) = 2^2.

Zhi-Wei Sun, Table of n, a(n) for n = 1..10000
Zhi-Wei Sun, Refining Lagrange's four-square theorem, J. Number Theory 175(2017), 167-190.
Zhi-Wei Sun, Restricted sums of four squares, arXiv:1701.05868 [math.NT], 2017.

Cf. A000118, A000290, A271518, A281975, A281976, A281939, A283170.

SQ[n_]:=SQ[n]=IntegerQ[Sqrt[n]];
Do[r=0;Do[If[SQ[2(-1)^i*x+(-1)^j*y],Do[If[SQ[n-x^2-y^2-z^2]&&SQ[2(-1)^i*x+(-1)^k*z],r=r+1],{z,y,Sqrt[n-1-x^2-y^2]},{k,0,Min[z,1]}]],{x,0,Sqrt[n-1]},{y,0,Sqrt[(n-1-x^2)/2]},{i,0,Min[x,1]},{j,0,Min[y,1]}];Print[n," ",r];Continue,{n,1,80}]

A283239 Number of ways to write n as x^2 + y^2 + z(3z-1)/2 with x,y,z integers such that x + 2*y is a square.

Original entry on oeis.org

1, 2, 3, 2, 2, 5, 5, 5, 1, 2, 4, 2, 5, 3, 3, 4, 3, 7, 5, 3, 8, 3, 5, 3, 2, 6, 3, 7, 5, 3, 4, 7, 5, 3, 4, 6, 5, 3, 3, 7, 5, 5, 5, 1, 6, 7, 6, 4, 3, 2, 5, 5, 9, 6, 3, 7, 5, 7, 5, 4, 8, 5, 6, 4, 6, 5, 5, 8, 5, 6, 6, 7, 5, 5, 5, 7, 5, 6, 2, 4, 12

Offset: 0

Zhi-Wei Sun, Mar 03 2017

nonn

Conjecture: (i) a(n) > 0 for all n = 0,1,2,..., and a(n) = 1 only for n = 0, 8, 43, 84, 133, 253, 399, 488, 523, 803, 7369.
(ii) Any integer n > 1 can be written as p + x^2 + y^2 with p prime and x + 2*y (or x + 3*y) a square, where x is an integer and y is a nonnegative integer.
Note that those numbers z*(3*z-1)/2 with z integral are called generalized pentagonal numbers (A001318). By Theorem 1.7(ii) of the linked paper in Sci. China Math., each n = 0,1,2,... can be written as the sum of two squares and a generalized pentagonal number.
Ju. V. Linnik proved in 1960 that any sufficiently large integer can be expressed as the sum of a prime and two squares.

			a(8) = 1 since 8 = 1^2 + 0^2 + (-2)*(3*(-2)-1)/2 with 1 + 2*0 = 1^2.
a(43) = 1 since 43 = 1^2 + 4^2 + (-4)*(3*(-4)-1)/2 with 1 + 2*4 = 3^2.
a(84) = 1 since 84 = 7^2 + (-3)^2 + (-4)*(3*(-4)-1)/2 with 7 + 2*(-3) = 1^2.
a(133) = 1 since 133 = 4^2 + 0^2 + 9*(3*9-1)/2 with 4 + 2*0 = 2^2.
a(253) = 1 since 253 = (-13)^2 + 7^2 + 5*(3*5-1)/2 with (-13) + 2*7 = 1^2.
a(399) = 1 since 399 = 18^2 + (-7)^2 + (-4)*(3*(-4)-1)/2 with 18 + 2*(-7) = 2^2.
a(488) = 1 since 488 = 9^2 + 20^2 + (-2)*(3*(-2)-1)/2 with 9 + 2*20 = 7^2.
a(523) = 1 since 523 = 9^2 + 0^2 + (-17)*(3*(-17)-1)/2 with 9 + 2*0 = 3^2.
a(803) = 1 since 803 = (-17)^2 + 13^2 + (-15)*(3*(-15)-1)/2 with (-17) + 2*13 = 3^2.
a(7369) = 1 since 7369 = 0^2 + 72^2 + (-38)*(3*(-38)-1)/2 with 0 + 2*72 = 12^2.

Zhi-Wei Sun, Table of n, a(n) for n = 0..10000
Ju. V. Linnik, An asymptotic formula in an additive problem of Hardy-Littlewood, Izv. Akad. Nauk SSSR Ser. Mat., 24 (1960), 629-706 (Russian).
Zhi-Wei Sun, On universal sums of polygonal numbers, Sci. China Math. 58 (2015), no. 7, 1367-1396.
Zhi-Wei Sun, Refining Lagrange's four-square theorem, J. Number Theory 175 (2017), 167-190.
Zhi-Wei Sun, Restricted sums of four squares, arXiv:1701.05868 [math.NT], 2017.

Cf. A000040, A000290, A001318, A001481, A276415, A283170, A283196, A283204, A283205.

SQ[n_]:=SQ[n]=IntegerQ[Sqrt[n]];
PenQ[n_]:=PenQ[n]=SQ[24n+1];
Do[r=0;Do[If[PenQ[n-x^2-y^2],Do[If[SQ[(-1)^i*x+2(-1)^j*y],r=r+1],{i,0,Min[x,1]},{j,0,Min[y,1]}]],{x,0,Sqrt[n]},{y,0,Sqrt[n-x^2]}];Print[n," ",r];Continue,{n,0,80}]

A283204 Numbers of the form x^2 + y^2 with x and y integers such that x + 2*y is a square.

Original entry on oeis.org

0, 1, 2, 4, 5, 10, 13, 16, 17, 18, 20, 26, 29, 32, 34, 37, 45, 50, 52, 53, 58, 61, 64, 65, 68, 74, 80, 81, 85, 97, 100, 106, 109, 113, 116, 122, 125, 130, 145, 146, 148, 149, 157, 160, 162, 170, 173, 180, 197, 205, 208, 218, 221, 234, 245, 250, 256, 260, 261, 269

Offset: 1

Zhi-Wei Sun, Mar 03 2017

nonn

This sequence is interesting since part (i) of the conjecture in A283170 implies that each n = 0,1,2,... can be expressed as the sum of two terms of the current sequence.

Clearly, the sequence is a subsequence of A001481. See also A283205 for a similar sequence.

			a(1) = 0 since 0 = 0^2 + 0^2 with 0 + 2*0 = 0^2.
a(2) = 1 since 1 = 1^2 + 0^2 with 1 + 2*0 = 1^2.
a(3) = 2 since 2 = (-1)^2 + 1^2 with (-1) + 2*1 = 1^2.
a(4) = 4 since 4 = 0^2 + 2^2 with 0 + 2*2 = 2^2.
a(5) = 5 since 5 = 2^2 + 1^2 with 2 + 2*1 = 2^2.
a(6) = 10 since 10 = 3^2 + (-1)^2 with 3 + 2*(-1) = 1^2.

Zhi-Wei Sun, Table of n, a(n) for n = 1..10000
Zhi-Wei Sun, Refining Lagrange's four-square theorem, J. Number Theory 175(2017), 167-190.
Zhi-Wei Sun, Restricted sums of four squares, arXiv:1701.05868 [math.NT], 2017.

Cf. A000290, A001481, A283170, A283196, A283205.

SQ[n_]:=SQ[n]=IntegerQ[Sqrt[n]];
n=0;Do[Do[If[SQ[m-x^2],Do[If[SQ[(-1)^i*x+2(-1)^j*Sqrt[m-x^2]],n=n+1;Print[n," ",m];Goto[aa]],{i,0,Min[x,1]},{j,0,Min[Sqrt[m-x^2],1]}]],{x,0,Sqrt[m]}];Label[aa];Continue,{m,0,270}]

A283205 Numbers of the form x^2 + y^2 with x and y integers such that x + 3*y is a square.

Original entry on oeis.org

0, 1, 2, 5, 8, 9, 10, 13, 16, 17, 25, 26, 29, 32, 34, 37, 40, 50, 53, 58, 61, 65, 73, 74, 80, 81, 85, 90, 104, 109, 117, 125, 128, 130, 136, 137, 144, 145, 146, 160, 162, 170, 178, 185, 193, 202, 208, 221, 229, 232, 241, 245, 250, 256, 257, 265, 269, 272, 274, 281

Offset: 1

Zhi-Wei Sun, Mar 03 2017

nonn

This sequence is interesting since part (ii) of the conjecture in A283170 implies that each n = 0,1,2,... can be expressed as the sum of two terms of the current sequence.

Clearly, the sequence is a subsequence of A001481.

			a(1) = 0 since 0 = 0^2 + 0^2 with 0 + 3*0 = 0^2.
a(2) = 1 since 1 = 1^2 + 0^2 with 1 + 3*0 = 1^2.
a(3) = 2 since 2 = 1^2 + 1^2 with 1 + 3*1 = 2^2.
a(4) = 5 since 5 = (-2)^2 + 1^2 with (-2) + 3*1 = 1^2.
a(5) = 8 since 8 = (-2)^2 + 2^2 with (-2) + 3*2 = 2^2.
a(6) = 9 since 9 = 0^2 + 3^2 with 0 + 3*3 = 3^2.
a(7) = 10 since 10 = 3^2 + (-1)^2 with 3 + 3*(-1) = 0^2.

Zhi-Wei Sun, Table of n, a(n) for n = 1..10000
Zhi-Wei Sun, Refining Lagrange's four-square theorem, J. Number Theory 175(2017), 167-190.
Zhi-Wei Sun, Restricted sums of four squares, arXiv:1701.05868 [math.NT], 2017.

Cf. A000290, A001481, A281939, A283170, A283204.

SQ[n_]:=SQ[n]=IntegerQ[Sqrt[n]];
n=0;Do[Do[If[SQ[m-x^2],Do[If[SQ[(-1)^i*x+3(-1)^j*Sqrt[m-x^2]],n=n+1;Print[n," ",m];Goto[aa]],{i,0,Min[x,1]},{j,0,Min[Sqrt[m-x^2],1]}]],{x,0,Sqrt[m]}];Label[aa];Continue,{m,0,281}]

A283269 Number of ways to write n as x^2 + y^2 + z^2 with x,y,z integers such that x + 3y + 5z is a square.

Original entry on oeis.org

1, 1, 2, 2, 0, 3, 5, 0, 3, 4, 4, 1, 0, 3, 7, 0, 1, 5, 3, 3, 0, 5, 3, 0, 6, 2, 8, 2, 0, 8, 3, 0, 2, 3, 6, 7, 0, 2, 6, 0, 6, 8, 4, 1, 0, 4, 3, 0, 2, 3, 7, 5, 0, 4, 13, 0, 8, 5, 2, 3, 0, 6, 6, 0, 0, 7, 13, 2, 0, 7, 3, 0, 5, 4, 9, 1, 0, 5, 3, 0, 3

Offset: 0

Zhi-Wei Sun, Mar 04 2017

nonn

Conjecture: (i) a(2^k*m) > 0 for any positive odd integers k and m. Also, a(4*n+1) = 0 only for n = 63.
(ii) For any positive odd integers k and m, we can write 2^k*m as x^2 + y^2 + z^2 with x,y,z integers such that x + 3*y + 5*z is twice a square.
(iii) For any positive odd integer n not congruent to 7 modulo 8, we can write n as x^2 + y^2 + z^2 with x,y,z integers such that x + 3*y + 4*z is a square.
(iv) Let n be any nonnegative integer. Then we can write 8*n + 1 as x^2 + y^2 + z^2 with x + 3*y a square, where x and y are integers, and z is a positive integer. Also, except for n = 2255, 4100 we can write 4*n + 2 as x^2 + y^2 + z^2 with x + 3*y a square, where x,y,z are integers.
(v) For each n = 0,1,2,..., we can write 8*n + 6 as x^2 + y^2 + z^2 with x + 2*y a square, where x,y,z are integers with y nonnegative and z odd.
The Gauss-Legendre theorem asserts that a nonnegative integer can be written as the sum of three squares if and only if it is not of the form 4^k*(8m+7) with k and m nonnegative integers. Thus a(4^k*(8m+7)) = 0 for all k,m = 0,1,2,....
See also A283273 for a similar conjecture.

			a(11) = 1 since 11 = 3^2 + 1^2 + (-1)^2 with 3 + 3*1 + 5*(-1) = 1^2.
a(43) = 1 since 43 = (-5)^2 + (-3)^2 + 3^2 with (-5) + 3*(-3) + 5*3 = 1^2.
a(75) = 1 since 75 = (-1)^2 + 5^2 + 7^2 with (-1) + 3*5 + 5*7 = 7^2.
a(262) = 1 since 262 = 1^2 + 15^2 + (-6)^2 with 1 + 3*15 + 5*(-6) = 4^2.
a(277) = 1 since 277 = (-6)^2 + 4^2 + 15^2 with (-6) + 3*4 + 5*15 = 9^2.
a(617) = 1 since 617 = 17^2 + 18^2 + 2^2 with 17 + 3*18 + 5*2 = 9^2.
a(1430) = 1 since 1430 = (-13)^2 + (-6)^2 + 35^2 with (-13) + 3*(-6) + 5*35 = 12^2.
a(5272) = 1 since 5272 = (-66)^2 + 30^2 + (-4)^2 with (-66) + 3*30 + 5*(-4) = 2^2.
a(7630) = 1 since 7630 = (-78)^2 + 39^2 + 5^2 with (-78) + 3*39 + 5*5 = 8^2.
a(7933) = 1 since 7933 = (-56)^2 + 69^2 + (-6)^2 with (-56) + 3*69 + 5*(-6) = 11^2.
a(14193) = 1 since 14193 = (-7)^2 + 112^2 + 40^2 with (-7) + 3*112 + 5*40 = 23^2.

Zhi-Wei Sun, Table of n, a(n) for n = 0..10000
Zhi-Wei Sun, Refining Lagrange's four-square theorem, J. Number Theory 175(2017), 167-190.
Zhi-Wei Sun, Restricted sums of four squares, arXiv:1701.05868 [math.NT], 2017.

Cf. A000290, A005875, A271518, A283170, A283196, A283204, A283205, A283239, A283273.

SQ[n_]:=SQ[n]=IntegerQ[Sqrt[n]];
Do[r=0;Do[If[SQ[n-x^2-y^2]&&SQ[(-1)^i*x+(-1)^j*3y+(-1)^k*5*Sqrt[n-x^2-y^2]],r=r+1],{x,0,Sqrt[n]},{y,0,Sqrt[n-x^2]},{i,0,Min[x,1]},{j,0,Min[y,1]},{k,0,Min[Sqrt[n-x^2-y^2],1]}];Print[n," ",r];Continue,{n,0,80}]

A283273 Number of ways to write n as x^2 + y^2 + z^2 with x,y integers and z a nonnegative integer such that x + 2y + 3z is a square or twice a square.

Original entry on oeis.org

1, 2, 4, 3, 2, 6, 3, 0, 4, 6, 4, 5, 3, 5, 7, 0, 2, 3, 4, 6, 6, 7, 5, 0, 3, 4, 9, 5, 0, 15, 4, 0, 4, 3, 6, 9, 6, 4, 7, 0, 4, 7, 7, 4, 5, 9, 3, 0, 3, 2, 6, 9, 5, 11, 12, 0, 7, 5, 4, 13, 0, 9, 6, 0, 2, 9, 11, 2, 3, 6, 5, 0, 4, 5, 12, 6, 6, 11, 5, 0, 6

Offset: 0

Zhi-Wei Sun, Mar 04 2017

nonn

Conjecture: (i) For any nonnegative integer n not of the form 4^k*(8*m+7) (k,m = 0,1,2,...), we have a(n) > 0.
(ii) Any nonnegative integer not of the form 4^k*(8*m+7) (k,m = 0,1,2,...) can be written as x^2 + y^2 + z^2 with x,y,z integers such that a*x + b*y + c*z is a square or twice a square, whenever (a,b,c) is among the triples (1,2,5), (1,3,4), (1,4,7), (1,6,7), (2,3,4), (2,3,9), (3,4,7), (3,4,9).
The Gauss-Legendre theorem states that a nonnegative integer can be written as the sum of three squares if and only if it is not of the form 4^k*(8*m+7) with k and m nonnegative integers. Thus a(4^k*(8*m+7)) = 0 for all k,m = 0,1,2,..., and part (i) of our conjecture (verified for n up to 1.6*10^6) is stronger than the Gauss-Legendre theorem.
See also A283269 for a similar conjecture.

			a(82) = 1 since 82 = 0^2 + (-1)^2 + 9^2 with 0 + 2*(-1) + 3*9 = 5^2.
a(328) = 1 since 328 = 0^2 + (-2)^2 + 18^2 with 0 + 2*(-2) + 3*18 = 2*5^2.
a(330) = 1 since 330 = 5^2 + 4^2 + 17^2 with 5 + 2*4 + 3*17 = 8^2.
a(466) = 1 since 466 = 21^2 + 0^2 + 5^2 with 21 + 2*0 + 3*5 = 6^2.
a(1320) = 1 since 1320 = 10^2 + 8^2 + 34^2 with 10 + 2*8 + 3*34 = 2*8^2.
a(1387) = 1 since 1387 = 33^2  + (-17)^2 + 3^2 with 33 + 2*(-17) + 3*3 = 2*2^2.
a(1857) = 1 since 1857 = (-37)^2 + (-2)^2 + 22^2 with (-37) + 2*(-2) + 3*22 = 5^2.
a(1864) = 1 since 1864 = 42^2 + 0^2 + 10^2 with 42 + 2*0 + 3*10 = 2*6^2.
a(2386) = 1 since 2386 = (-44)^2 + 3^2 + 21^2 with (-44) + 2*3 + 3*21 = 5^2.
a(5548) = 1 since 5548 = 66^2 + (-34)^2 + 6^2 with 66 + 2*(-34) + 3*6 = 4^2.
a(7428) = 1 since 7428 = (-74)^2 + (-4)^2 + 44^2 with (-74) + 2*(-4) + 3*44 = 2*5^2.
a(9544) = 1 since 9544 = (-88)^2 + 6^2 + 42^2 with (-88) + 2*6 + 3*42 = 2*5^2.

Zhi-Wei Sun, Table of n, a(n) for n = 0..10000
Zhi-Wei Sun, Refining Lagrange's four-square theorem, J. Number Theory 175(2017), 167-190.
Zhi-Wei Sun, Restricted sums of four squares, arXiv:1701.05868 [math.NT], 2017.

Cf. A000290, A005875, A271518, A275344, A283170, A283196, A283204, A283205, A283239, A283269.

SQ[n_]:=SQ[n]=IntegerQ[Sqrt[n]];
TQ[n_]:=TQ[n]=SQ[n]||SQ[2n];
Do[r=0;Do[If[SQ[n-x^2-y^2]&&TQ[(-1)^i*x+(-1)^j*2y+3*Sqrt[n-x^2-y^2]],r=r+1],{x,0,Sqrt[n]},{y,0,Sqrt[n-x^2]},{i,0,Min[x,1]},{j,0,Min[y,1]}];Print[n," ",r];Continue,{n,0,80}]

A283617 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x,y,z,w integers and 0 <= z <= w such that x^3 + 2*y^3 is a square.

Original entry on oeis.org

1, 2, 3, 2, 3, 3, 3, 1, 2, 3, 4, 3, 3, 2, 3, 2, 2, 4, 6, 4, 6, 3, 3, 2, 2, 3, 6, 5, 3, 4, 3, 2, 3, 4, 5, 4, 7, 3, 4, 2, 3, 6, 5, 3, 3, 4, 2, 3, 2, 3, 7, 4, 6, 4, 5, 3, 2, 4, 4, 4, 4, 3, 4, 4, 3, 6, 8, 4, 9, 6, 2, 3, 4, 4, 7, 5, 4, 4, 3, 1, 3

Offset: 0

Zhi-Wei Sun, Mar 12 2017

nonn

Conjecture: (i) Let a and b >= a be positive integers with gcd(a,b) squarefree. Then, every n = 0,1,2,... can be written as x^2 + y^2 + z^2 + w^2 with x,y,z,w integers such that a*x^3 + b*y^3 is a square, if and only if (a,b) is among the ordered pairs (1,2), (1,8), (2,16), (4,23), (4,31), (5,9), (8,9), (8,225), (9,47), (25,88), (50,54).
(ii) Each n = 0,1,2,... can be written as x^2 + y^2 + z^2 + w^2 with x a nonnegative integer and y,z,w integers such that a*x^3 + b*y^3 is a square, whenever (a,b) is among the ordered pairs (1,8), (2,16), (8,1), (9,8), (88,25), (225,8).
(iii) Any positive integer can be written as x^2 + y^2 + z^2 + w^2 with x,y,z integers and w a positive integer such that x^3 + 19*y^3 + 19*z^3 is an integer cube.
(iv) Every n = 0,1,2,... can be written as x^2 + y^2 + z^2 + w^2 with x,y,z,w integers such that a*x^3 + b*y^3 + c*z^3 + d*w^3 is a square, whenever (a,b,c,d) is among the ordered quadruples (1,1,3,4), (1,2,3,5), (1,2,3,7), (1,2,4,5),(1,2,5,7), (1,3,4,5), (1,3,4,7), (1,3,6,8), (1,3,8,13), ((1,4,5,9), (1,7,8,11), (1,8,9,10), (1,8,9,11), (2,3,4,7), (2,4,7,9), (2,4,7,14), (2,7,9,11), (3,4,5,7), (3,8,9,11).
By the linked JNT paper, each n = 0,1,2,... can be written as x^2 + y^2 + z^2 + w^2 with x,y,z,w integers such that x + 2*y is a square.

			a(0) = 1 since 0 = 0^2 + 0^2 + 0^2 + 0^2 with 0^3 + 2*0^3 = 0^2.
a(7) = 1 since 7 = (-1)^2 + 1^2 + 1^2 + 2^2 with (-1)^3 + 2*1^3 = 1^2.
a(79) = 1 since 79 = 3^2 + 3^2 + 5^2 + 6^2 with 3^3 + 2*3^3 = 9^2.
a(88) = 1 since 88 = 4^2 + 0^2 + 6^2 + 6^2 with 4^3 + 2*0^3 = 8^2.
a(151) = 1 since 151 = (-1)^2 + 1^2 + 7^2 + 10^2 with (-1)^3 + 2*1^3 = 1^2.
a(219) = 1 since 219 = 1^2 + 0^2 + 7^2 + 13^2 with 1^3 + 2*0^3 = 1^2.
a(438) = 1 since 438 = (-1)^2 + 1^2 + 6^2 + 20^2 with (-1)^3 + 2*1^3 = 1^2.
a(471) = 1 since 471 = 3^2 + (-1)^2 + 10^2 + 19^2 with 3^3 + 2*(-1)^3 = 5^2.
a(599) = 1 since 599 = 7^2 + (-3)^2 + 10^2 + 21^2 with 7^3 + 2*(-3)^3 = 17^2.
a(751) = 1 since 751 = 3^2 + 3^2 + 2^2 + 27^2 with 3^3 + 2*3^3 = 9^2.
a(807) = 1 since 807 = 3^2 + (-1)^2 + 11^2 + 26^2 with 3^3 + 2*(-1)^3 = 5^2.
a(19743) = 1 since 19743 = (-25)^2 + 25^2 + 58^2 + 123^2 with (-25)^3 + 2*25^3 = 125^2.

Zhi-Wei Sun, Table of n, a(n) for n = 0..10000
Zhi-Wei Sun, Refining Lagrange's four-square theorem, J. Number Theory 175(2017), 167-190.
Zhi-Wei Sun, Restricted sums of four squares, arXiv:1701.05868 [math.NT], 2017.

Cf. A000118, A000290, A000578, A271518, A281976, A283170, A283196.

SQ[n_]:=SQ[n]=IntegerQ[Sqrt[n]];
Do[r=0;Do[If[SQ[(-1)^i*x^3+2(-1)^j*y^3],Do[If[SQ[n-x^2-y^2-z^2],r=r+1],{z,0,Sqrt[(n-x^2-y^2)/2]}]],{x,0,Sqrt[n]},{i,0,Min[x,1]},{y,0,Sqrt[n-x^2]},{j,0,Min[y,1]}];Print[n," ",r],{n,0,80}]

cp's OEIS Frontend

A283196 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with 2*x + y and 2*x + z both squares, where x,y,z are integers with |y| <= |z|, and w is a positive integer.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A283239 Number of ways to write n as x^2 + y^2 + z*(3*z-1)/2 with x,y,z integers such that x + 2*y is a square.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A283204 Numbers of the form x^2 + y^2 with x and y integers such that x + 2*y is a square.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A283205 Numbers of the form x^2 + y^2 with x and y integers such that x + 3*y is a square.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A283269 Number of ways to write n as x^2 + y^2 + z^2 with x,y,z integers such that x + 3*y + 5*z is a square.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A283273 Number of ways to write n as x^2 + y^2 + z^2 with x,y integers and z a nonnegative integer such that x + 2*y + 3*z is a square or twice a square.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A283617 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x,y,z,w integers and 0 <= z <= w such that x^3 + 2*y^3 is a square.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A283196 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with 2x + y and 2x + z both squares, where x,y,z are integers with |y| <= |z|, and w is a positive integer.

A283239 Number of ways to write n as x^2 + y^2 + z(3z-1)/2 with x,y,z integers such that x + 2*y is a square.

A283269 Number of ways to write n as x^2 + y^2 + z^2 with x,y,z integers such that x + 3y + 5z is a square.

A283273 Number of ways to write n as x^2 + y^2 + z^2 with x,y integers and z a nonnegative integer such that x + 2y + 3z is a square or twice a square.