A281941 -id:A281941 - cp's OEIS frontend

A281976 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers and z <= w such that both x and x + 24*y are squares.

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

Offset: 0

Zhi-Wei Sun, Feb 04 2017

nonn

Conjecture: a(n) > 0 for all n = 0,1,2,..., and a(n) = 1 only for n = 0, 16^k*m (k = 0,1,2,... and m = 8, 12, 23, 24, 47, 71, 168, 344, 632, 1724).
By the linked JNT paper, any nonnegative integer can be written as the sum of a fourth power and three squares.
We have verified a(n) > 0 for all n = 0..10^7.
See also A281977, A282013 and A282014 for similar conjectures.
a(n) <= A273404(n). Starts to differ from A273404 at n=145. - R. J. Mathar, Feb 12 2017
Qing-Hu Hou at Tianjin Univ. has verified a(n) > 0 for all n = 0..10^10.
I would like to offer 2400 US dollars for the first proof of my conjecture that a(n) > 0 for any nonnegative integer n. - Zhi-Wei Sun, Feb 14 2017

			a(8) = 1 since 8 = 0^2 + 0^2 + 2^2 + 2^2 with 0 = 0^2 and 0 + 24*0 = 0^2.
a(12) = 1 since 12 = 1^2 + 1^2 + 1^2 + 3^2 with 1 = 1^2 and 1 + 24*1 = 5^2.
a(23) = 1 since 23 = 1^2 + 2^2 + 3^2 + 3^2 with 1 = 1^2 and 1 + 24*2 = 7^2.
a(24) = 1 since 24 = 4^2 + 0^2 + 2^2 + 2^2 with 4 = 2^2 and 4 + 24*0 = 2^2.
a(47) = 1 since 47 = 1^2 + 1^2 + 3^2 + 6^2 with 1 = 1^2 and 1 + 24*1 = 5^2.
a(71) = 1 since 71 = 1^2 + 5^2 + 3^2 + 6^2 with 1 = 1^2 and 1 + 24*5 = 11^2.
a(168) = 1 since 168 = 4^2 + 4^2 + 6^2 + 10^2 with 4 = 2^2 and 4 + 24*4 = 10^2.
a(344) = 1 since 344 = 4^2 + 0^2 + 2^2 + 18^2 with 4 = 2^2 and 4 + 24*0 = 2^2.
a(632) = 1 since 632 = 0^2 + 6^2 + 14^2 + 20^2 with 0 = 0^2 and 0 + 24*6 = 12^2.
a(1724) = 1 since 1724 = 25^2 + 1^2 + 3^2 + 33^2 with 25 = 5^2 and 25 + 24*1 = 7^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.
Zhi-Wei Sun, The 24-conjecture with $2400 prize, a message to Number Theory List, Feb. 14, 2017.

Cf. A000118, A000290, A000583, A270969, A273404, A281939, A281941, A281975, A281977, A281980, A282013, A282014.

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

A281939 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x - y and 3*z + w both squares, where x,y,z are nonnegative integers and w is an integer.

Original entry on oeis.org

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

Offset: 0

Zhi-Wei Sun, Feb 02 2017

nonn

Conjecture: (i) a(n) > 0 for all n = 0,1,2,....
(ii) Any nonnegative integer n can be written as x^2 + y^2 + z^2 + w^2 with |2*x-y| and 3*z+2*w both squares, where x,y,z are nonnegative integers and w is an integer.
(iii) Any nonnegative integer n can be written as x^2 + y^2 + z^2 + w^2 with x+2*y a square and z+2*w twice a square, where x,y,z,w are integers.
(iv) For each k = 1,3, every nonnegative integer n can be written as x^2 + y^2 + z^2 + w^2 with x+k*y and z+5*w both squares, where x,y,z,w are integers.
(v) Any nonnegative integer n can be written as x^2 + y^2 + z^2 + w^2 with x+2*y and 6*z+2*w both squares, where x,y,z,w are integers.

			a(4) = 1 since 4 = 1^2 + 1^2 + 1^2 + 1^2 with 1 - 1 = 0^2 and 3*1 + 1 = 2^2.
a(12) = 1 since 12 = 1^2 + 1^2 + 1^2 + (-3)^2 with 1 - 1 = 0^2 and 3*1 + (-3) = 0^2.
a(19) = 1 since 19 = 3^2 + 3^2 + 0^2 + 1^2 with 3 - 3 = 0^2 and 3*0 + 1 = 1^2.
a(20) = 1 since 20 = 3^2 + 3^2 + 1^2 + 1^2 with 3 - 3 = 0^2 and 3*1 + 1 = 2^2.
a(22) = 1 since 22 = 3^2 + 2^2 + 3^2 + 0^2 with 3 - 2 = 1^2 and 3*3 + 0 = 3^2.
a(44) = 1 since 44 = 3^2 + 3^2 + 5^2 + 1^2 with 3 - 3 = 0^2 and 3*5 + 1 = 4^2.
a(46) = 1 since 46 = 5^2 + 4^2 + 1^2 + (-2)^2 with 5 - 4 = 1^2 and 3*1 + (-2) = 1^2.
a(68) = 1 since 68 = 7^2 + 3^2 + 1^2 + (-3)^2 with 7 - 3 = 2^2 and 3*1 + (-3) = 0^2.
a(212) = 1 since 212 = 5^2 + 5^2 + 9^2 + 9^2 with 5 - 5 = 0^2 and 3*9 + 9 = 6^2.
a(1144) = 1 since 1144 = 20^2 + 16^2 + 22^2 + (-2)^2 with 20 - 16 = 2^2 and 3*22 + (-2) = 8^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.

Cf. A000118, A000290, A271775, A281941.

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

A281977 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers such that both x and -7x - 8y + 8z + 16w are squares.

Original entry on oeis.org

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

Offset: 0

Zhi-Wei Sun, Feb 04 2017

nonn

Conjecture: a(n) > 0 for all n = 0,1,2,....
The author has proved that any nonnegative integer can be written as the sum of a fourth power and three squares.
We have verified the conjecture for all n = 0..10^6.
See also A281976, A282013 and A282014 for similar conjectures.
Qing-Hu Hou at Tianjin University verified a(n) > 0 for n up to 10^8. - Zhi-Wei Sun, Jun 02 2019

			a(1) = 1 since 1 = 0^2 + 0^2 + 0^2 + 1^2 with 0 = 0^2 and -7*0 - 8*0 + 8*0 + 16*1 = 4^2.
a(12) = 1 since 12 = 1^2 + 1^2 + 3^2 + 1^2 with 1 = 1^2 and -7*1 - 8*1 + 8*3 + 16*1 = 5^2.
a(17) = 1 since 17 = 1^2 + 0^2 + 4^2 + 0^2 with 1 = 1^2 and -7*1 - 8*0 + 8*4 + 16*0 = 5^2.
a(28) = 1 since 28 = 4^2 + 2^2 + 2^2 + 2^2 with 4 = 2^2 and -7*4 - 8*2 + 8*2 + 16*2 = 2^2.
a(31) = 1 since 31 = 1^2 + 1^2 + 2^2 + 5^2 with 1 = 1^2 and -7*1 - 8*1 + 8*2 + 16*5 = 9^2.
a(40) = 1 since 40 = 4^2 + 2^2 + 2^2 + 4^2 with 4 = 2^2 and -7*4 -8*2 + 8*2 + 16*4 = 6^2.
a(41) = 1 since 41 = 1^2 + 2^2 + 6^2 + 0^2 with 1 = 1^2 and -7*1 - 8*2 + 8*6 + 16*0 = 5^2.
a(49) = 1 since 49 = 0^2 + 6^2 + 2^2 + 3^2 with 0 = 0^2 and -7*0 - 8*6 + 8*2 + 16*3 = 4^2.
a(241) = 1 since 241 = 9^2 + 4^2 + 12^2 + 0^2 with 9 = 3^2 and -7*9 - 8*4 + 8*12 + 16*0 = 1^2.
a(433) = 1 since 433 = 16^2 + 8^2 + 8^2 + 7^2 with 16 = 4^2 and -7*16 - 8*8 + 8*8 + 16*7 = 0^2.
a(1113) = 1 since 1113 = 1^2 + 30^2 + 4^2 + 14^2 with 1 = 1^2 and -7*1 - 8*30 + 8*4 + 16*14 = 3^2.
a(1521) = 1 since 1521 = 0^2 + 22^2 + 14^2 + 29^2 with 0 = 0^2 and -7*0 - 8*22 + 8*14 + 16*29 = 20^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, A270969, A281939, A281941, A281975, A281976, A282013, A282014.

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

A282013 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers such that both x and 49x + 48(y-z) are squares.

Original entry on oeis.org

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

Offset: 0

Zhi-Wei Sun, Feb 04 2017

nonn

Conjecture: a(n) > 0 for all n = 0,1,2,..., and a(n) = 1 only for n = 0, 16^k*m (k = 0,1,2,... and m = 5, 8, 14, 31, 47, 71, 79, 143, 248, 463, 1039).
The author has proved that any nonnegative integer can be written as the sum of a fourth power and three squares.
We have verified a(n) > 0 for all n = 0..10^7.
See also A281976, A281977 and A282014 for similar conjectures.
Qing-Hu Hou at Tianjin University verified a(n) > 0 for n up to 10^9. - Zhi-Wei Sun, Jun 02 2019

			a(5) = 1 since 5 = 1^2 + 0^2 + 0^2 + 2^2 with 1 = 1^2 and 49*1 + 48*(0-0) = 7^2.
a(8) = 1 since 8 = 0^2 + 2^2 + 2^2 + 0^2 with 0 = 0^2 and 49*0 + 48*(2-2) = 0^2.
a(14) = 1 since 14 = 1^2 + 2^2 + 3^2 + 0^2 with 1 = 1^2 and 49*1 + 48*(2-3) = 1^2.
a(31) = 1 since 31 = 1^2 + 1^2 + 2^2 + 5^2 with 1 = 1^2 and 49*1 + 48*(1-2) = 1^2.
a(47) = 1 since 47 = 1^2 + 6^2 + 1^2 + 3^2 with 1 = 1^2 and 49*1 + 48*(6-1) = 17^2.
a(71) = 1 since 71 = 1^2 + 5^2 + 6^2 + 3^2 with 1 = 1^2 and 49*1 + 48*(5-6) = 1^2.
a(79) = 1 since 79 = 1^2 + 7^2 + 2^2 + 5^2 with 1 = 1^2 and 49*1 + 48*(7-2) = 17^2.
a(143) = 1 since 143 = 1^2 + 5^2 + 6^2 + 9^2 with 1 = 1^2 and 49*1 + 48*(5-6) = 1^2.
a(248) = 1 since 248 = 4^2 + 6^2 + 0^2 + 14^2 with 4 = 2^2 and 49*4 + 48*(6-0) = 22^2.
a(463) = 1 since 463 = 9^2 + 6^2 + 15^2 + 11^2 with 9 = 3^2 and 49*9 + 48*(6-15) = 3^2.
a(1039) = 1 since 1039 = 1^2 + 22^2 + 23^2 + 5^2 with 1 = 1^2 and 49*1 + 48*(22-23) = 1^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, A270969, A271518, A281939, A281941, A281975, A281976, A281977, A282014.

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

A282014 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers such that both x and 121x + 48(y-z) are squares.

Original entry on oeis.org

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

Offset: 0

Zhi-Wei Sun, Feb 04 2017

nonn

Conjecture: a(n) > 0 for all n = 0,1,2,..., and a(n) = 1 only for n = 0, 16^k*m (k = 0,1,2,... and m = 8, 29, 31, 40, 94, 104, 143, 319, 671).
The author has proved that any nonnegative integer can be written as the sum of a fourth power and three squares.
We have verified a(n) > 0 for all n = 0..10^7.
See also A281976, A281977 and A282013 for similar conjectures.
Qing-Hu Hou at Tianjin University verified a(n) > 0 for n up to 10^9. - Zhi-Wei Sun, Jun 02 2019

			a(8) = 1 since 8 = 0^2 + 2^2 + 2^2 + 0^2 with 0 = 0^2 and 121*0 + 48*(2-2) = 0^2.
a(29) = 1 since 29 = 0^2 + 5^2 + 2^2 + 0^2 with 0 = 0^2 and 121*0 + 48*(5-2) = 12^2.
a(31) = 1 since 31 = 1^2 + 2^2 + 1^2 + 5^2 with 1 = 1^2 and 121*1 + 48*(2-1) = 13^2.
a(40) = 1 since 40 = 4^2 + 2^2 + 2^2 + 4^2 with 4 = 2^2 and 121*4 + 48*(2-2) = 22^2.
a(94) = 1 since 94 = 0^2 + 6^2 + 3^2 + 7^2 with 0 = 0^2 and 121*0 + 48*(6-3) = 12^2.
a(104) = 1 since 104 = 4^2 + 6^2 + 6^2 + 4^2 with 4 = 2^2 and 121*4 + 48*(6-6) = 22^2.
a(143) = 1 since 143 = 1^2 + 6^2 + 5^2 + 9^2 with 1 = 1^2 and 121*1 + 48*(6-5) = 13^2.
a(319) = 1 since 319 = 1^2 + 17^2 + 2^2 + 5^2 with 1 = 1^2 and 121*1 + 48*(17-2) = 29^2.
a(671) = 1 since 671 = 9^2 + 5^2 + 23^2 + 6^2 with 9 = 3^2 and 121*9 + 48*(5-23) = 15^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, A270969, A271518, A281939, A281941, A281975, A281976, A281977, A282013.

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

A281975 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers and z <= w such that both x and |x-y| are squares.

Original entry on oeis.org

1, 3, 4, 3, 2, 4, 4, 2, 1, 4, 5, 3, 1, 2, 3, 2, 3, 5, 7, 3, 4, 5, 2, 1, 2, 6, 9, 6, 2, 4, 6, 3, 4, 6, 8, 4, 6, 5, 4, 3, 2, 11, 10, 4, 1, 7, 5, 1, 3, 3, 11, 9, 7, 5, 6, 4, 2, 7, 5, 4, 2, 6, 4, 3, 2, 7, 15, 4, 4, 6, 5, 1, 2, 6, 7, 7, 3, 6, 4, 2, 4

Offset: 0

Zhi-Wei Sun, Feb 03 2017

nonn

Conjecture: (i) a(n) > 0 for all n = 0,1,2,....
(ii) Each nonnegative integer n can be written as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers such that |x-y| and 2*(y-z) (or 2*(z-y)) are both squares.
(iii) For each ordered pair (a,b) = (2,1), (3,1), (9,5), (14,10), any nonnegative integer n can be written as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers such that x and |a*x-b*y| are both squares.
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 x-y, or 2(x-y)) is a square.
See also A281976 and A281977 for similar conjectures.

			a(8) = 1 since 8 = 0^2 + 0^2 + 2^2 + 2^2 with 0 = 0^2 and |0-0| = 0^2.
a(12) = 1 since 12 = 1^2 + 1^2 + 1^2 + 3^2 with 1 = 1^2 and |1-1| = 0^2.
a(44) = 1 since 44 = 1^2 + 5^2 + 3^2 + 3^2 with 1 = 1^2 and |1-5| = 2^2.
a(47) = 1 since 47 = 1^2 + 1^2 + 3^2 + 6^2 with 1 = 1^2 and |1-1| = 0^2.
a(71) = 1 since 71 = 1^2 + 5^2 + 3^2 + 6^2 with 1 = 1^2 and |1-5| = 2^2.
a(95) = 1 since 95 = 1^2 + 2^2 + 3^2 + 9^2 with 1 = 1^2 and |1-2| = 1^2.
a(140) = 1 since 140 = 9^2 + 5^2 + 3^2 + 5^2 with 9 = 3^2 and |9-5| = 2^2.
a(428) = 1 since 428 = 9^2 + 13^2 + 3^2 + 13^2 with 9 = 3^2 and |9-13| = 2^2.
a(568) = 1 since 568 = 4^2 + 8^2 + 2^2 + 22^2 with 4 = 2^2 and |4-8| = 2^2.
a(632) = 1 since 632 = 16^2 + 12^2 + 6^2 + 14^2 with 16 = 4^2 and |16-12| = 2^2.
a(1144) = 1 since 1144 = 16^2 + 20^2 + 2^2 + 22^2 with 16 = 4^2 and |16-20| = 2^2.
a(1544) = 1 since 1544 = 0^2 + 0^2 + 10^2 + 38^2 with 0 = 0^2 and |0-0| = 0^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.

Cf. A000118, A000290, A270969, A271775, A281939, A281941, A281976, A281977.

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

A281945 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers such that both x and x + y - z are powers of two (including 2^0 = 1).

Original entry on oeis.org

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

Offset: 1

Zhi-Wei Sun, Feb 02 2017

nonn

65213 is the first positive integer which cannot be written as x^2 + y^2 + z^2 + w^2 with x,y,z,w integers such that both x and x + y + z are powers of two. Though a(44997) = 0, we have

44997 = 128^2 + (-28)^2 + (-98)^2 + 1^2 with 128 = 2^7 and 128 + (-28) + (-98) = 2^1.

			a(1) = 1 since 1 = 1^2 + 0^2 + 0^2 + 0^2 with 1 = 2^0 and 1 + 0 - 0 = 2^0.
a(2237) = 1 since 2237 = 8^2 + 29^2 + 36^2 + 6^2 with 8 = 2^3 and 8 + 29 - 36 = 2^0.
a(4397) = 1 since 4397 = 4^2 + 21^2 + 24^2 + 58^2 with 4 = 2^2 and 4 + 21 - 24 = 2^0.
a(5853) = 1 since 5853 = 2^2 + 52^2 + 52^2 + 21^2 with 2 = 2^1 and 2 + 52 - 52 = 2^1.
a(14711) = 1 since 14711 = 1^2 + 18^2 + 15^2 + 119^2 with 1 = 2^0 and 1 + 18 - 15 = 2^2.
a(16797) = 1 since 16797 = 64^2 + 42^2 + 104^2 + 11^2 with 64 = 2^6 and 64 + 42 - 104 = 2^1.
a(17861) = 1 since 17861 = 32^2 + 0^2 + 31^2 + 126^2 with 32 = 2^5 and 32 + 0 - 31 = 2^0.
a(20959) = 1 since 20959 = 2^2 + 109^2 + 95^2 + 7^2 with 2 = 2^1 and 2 + 109 - 95 = 2^4.
a(21799) = 1 since 21799 = 1^2 + 146^2 + 19^2 + 11^2 with 1 = 2^0 and 1 + 146 - 19 = 2^7.
a(24757) = 1 since 24757 = 64^2 + 56^2 + 119^2 + 58^2 with 64 = 2^6 and 64 + 56 - 119 = 2^0.
a(28253) = 1 since 28253 = 2^2 + 3^2 + 4^2 + 168^2 with 2 = 2^1 and 2 + 3 - 4 = 2^0.

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. A000079, A000118, A000290, A279612, A281939, A281941.

SQ[n_]:=SQ[n]=IntegerQ[Sqrt[n]];
Pow[n_]:=Pow[n]=n>0&&IntegerQ[Log[2,n]];
Do[r=0;Do[If[SQ[n-4^x-y^2-z^2]&&Pow[2^x+y-z],r=r+1],{x,0,Log[4,n]},{y,0,Sqrt[n-4^x]},{z,0,Sqrt[n-4^x-y^2]}];Print[n," ",r];Continue,{n,1,80}]

A282161 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x and (12x)^2 + (5y-10*z)^2 both squares, where x,y,z are nonnegative integers and w is a positive integer.

Original entry on oeis.org

1, 3, 2, 2, 5, 4, 2, 2, 4, 6, 4, 3, 4, 6, 3, 1, 9, 7, 5, 6, 7, 7, 1, 4, 8, 11, 7, 1, 11, 10, 2, 3, 8, 9, 6, 9, 8, 11, 5, 5, 15, 7, 4, 5, 13, 9, 2, 2, 8, 15, 10, 8, 10, 17, 3, 7, 12, 4, 10, 4, 11, 16, 3, 2, 18, 16, 6, 9, 15, 11, 4, 6, 8, 16, 12, 3, 13, 13, 1, 5

Offset: 1

Zhi-Wei Sun, Feb 07 2017

nonn

Conjecture: (i) a(n) > 0 for all n > 0, and a(n) = 1 only for n = 16^k*m (k = 0,1,2,... and m = 1, 23, 28, 79, 119, 191, 223, 263, 463, 703, 860, 1052).
(ii) Any positive integer n can be written as x^2 + y^2 + z^2 + w^2 with x and (35*x)^2 + (12*y-24*z)^2 both squares, where x,y,z are nonnegative integers and w is a positive integer.
The author has proved that any nonnegative integer can be written as the sum of a fourth power and three squares.
See also A281976, A281977, A282013 and A282014 for similar conjectures.

			a(1) = 1 since 1 = 0^2 + 0^2 + 0^2 + 1^2 with 0 = 0^2 and (12*0)^2 + (5*0-10*0)^2 = 0^2.
a(23) = 1 since 23 = 1^2 + 3^2 + 2^2 + 3^2 with 1 = 1^2 and (12*1)^2 + (5*3-10*2)^2 = 13^2.
a(28) = 1 since 28 = 1^2 + 1^2 + 1^2 + 5^2 with 1 = 1^2 and (12*1)^2 + (5*1-10*1)^2 = 13^2.
a(79) = 1 since 79 = 1^2 + 5^2 + 2^2 + 7^2 with 1 = 1^2 and (12*1)^2 + (5*5-10*2)^2 = 13^2.
a(119) = 1 since 119 = 1^2 + 9^2 + 1^2 + 6^2 with 1 = 1^2 and (12*1)^2 + (5*9-10*1)^2 = 37^2.
a(191) = 1 since 191 = 9^2 + 5^2 + 7^2 + 6^2 with 9 = 3^2 and (12*9)^2 + (5*5-10*7)^2 = 117^2.
a(223) = 1 since 223 = 1^2 + 13^2 + 7^2 + 2^2 with 1 = 1^2 and (12*1)^2 + (5*13-10*7)^2 = 13^2.
a(263) = 1 since 263 = 9^2 + 13^2 + 2^2 + 3^2 with 9 = 3^2 and (12*9)^2 + (5*13-10*2)^2 = 117^2.
a(463) = 1 since 463 = 1^2 + 19^2 + 10^2 + 1^2 with 1 = 1^2 and (12*1)^2 + (5*19-10*10)^2 = 13^2.
a(703) = 1 since 703 = 1^2 + 13^2 + 7^2 + 22^2 with 1 = 1^2 and (12*1)^2 + (5*13-10*7)^2 = 13^2.
a(860) = 1 since 860 = 4^2 + 18^2 + 18^2 + 14^2 with 4 = 2^2 and (12*4)^2 + (5*18-10*18)^2 = 102^2.
a(1052) = 1 since 1052 = 4^2 + 30^2 + 6^2 + 10^2 with 4 = 2^2 and (12*4)^2 + (5*30-10*6)^2 = 102^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, A270969, A271714, A273108, A281939, A281941, A281975, A281976, A281977, A282013, A282014.

SQ[n_]:=SQ[n]=IntegerQ[Sqrt[n]];
Do[r=0;Do[If[SQ[n-x^4-y^2-z^2]&&SQ[144x^4+(5y-10z)^2],r=r+1],{x,0,(n-1)^(1/4)},{y,0,Sqrt[n-1-x^4]},{z,0,Sqrt[n-1-x^4-y^2]}];Print[n," ",r];Continue,{n,1,80}]

cp's OEIS Frontend

A281976 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers and z <= w such that both x and x + 24*y are squares.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A281939 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x - y and 3*z + w both squares, where x,y,z are nonnegative integers and w is an integer.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A281977 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers such that both x and -7*x - 8*y + 8*z + 16*w are squares.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A282013 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers such that both x and 49*x + 48*(y-z) are squares.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A282014 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers such that both x and 121*x + 48*(y-z) are squares.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A281975 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers and z <= w such that both x and |x-y| are squares.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A281945 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers such that both x and x + y - z are powers of two (including 2^0 = 1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A282161 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x and (12*x)^2 + (5*y-10*z)^2 both squares, where x,y,z are nonnegative integers and w is a positive integer.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

A281977 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers such that both x and -7x - 8y + 8z + 16w are squares.

A282013 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers such that both x and 49x + 48(y-z) are squares.

A282014 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x,y,z,w nonnegative integers such that both x and 121x + 48(y-z) are squares.

A282161 Number of ways to write n as x^2 + y^2 + z^2 + w^2 with x and (12x)^2 + (5y-10*z)^2 both squares, where x,y,z are nonnegative integers and w is a positive integer.