OFFSET
1,6
COMMENTS
Conjecture: a(n) > 0 for all n > 1 not divisible by 4.
This is stronger than the conjecture in A291624. Obviously, it implies that there are infinitely many prime quadruples (p-2, p, p+4, p+10).
We have verified that a(n) > 0 for any integer 1 < n < 10^7 not divisible by 4.
LINKS
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.
EXAMPLE
a(61) = 1 since 61 = 4^2 + 0^2 + 3^2 + 6^2 with 4 + 2*0 + 5*3 = 19, 19 - 2 = 17, 19 + 4 = 23 and 19 + 10 = 29 all prime.
a(253) = 1 since 253 = 12^2 + 8^2 + 3^2 + 6^2 with 12 + 2*8 + 5*3 = 43, 43 - 2 = 41, 43 + 4 = 47 and 43 + 10 = 53 all prime.
a(725) = 1 since 725 = 7^2 + 0^2 + 0^2 + 26^2 with 7 + 2*0 + 5*0 = 7, 7 - 2 = 5, 7 + 4 = 11 and 7 + 10 = 17 all prime.
a(1511) = 1 since 1511 = 18^2 + 15^2 + 11^2 + 29^2 with 18 + 2*15 + 5*11 = 103, 103 - 2 = 101, 103 + 4 = 107 and 103 + 10 = 113 all prime.
MATHEMATICA
SQ[n_]:=SQ[n]=IntegerQ[Sqrt[n]];
PQ[p_]:=PQ[p]=PrimeQ[p]&&PrimeQ[p-2]&&PrimeQ[p+4]&&PrimeQ[p+10]
Do[r=0; Do[If[SQ[n-x^2-y^2-z^2]&&PQ[x+2y+5z], r=r+1], {x, 0, Sqrt[n]}, {y, 0, Sqrt[n-x^2]}, {z, 0, Sqrt[n-x^2-y^2]}]; Print[n, " ", r], {n, 1, 100}]
CROSSREFS
KEYWORD
nonn,look
AUTHOR
Zhi-Wei Sun, Aug 28 2017
STATUS
approved