login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Primes that can be represented exactly in one way as a^2 + b^2 + c^2, 0 < a <= b <= c.
1

%I #10 May 01 2013 20:59:23

%S 3,11,17,19,29,43,53,61,67,73,97,109,157,163,193,277,397

%N Primes that can be represented exactly in one way as a^2 + b^2 + c^2, 0 < a <= b <= c.

%C Note that there are no primes = 7 mod 8.

%C This sequence is probably complete. Is there a proof?

%C There are no more terms < 10^7. - _Donovan Johnson_, Mar 22 2012

%e {p,a,b,c}: {3,1,1,1}, {11,1,1,3}, {17,2,2,3}, {19,1,3,3}, {29,2,3,4}, {43,3,3,5}, {53,1,4,6}, {61,3,4,6}, {67,3,3,7}, {73,1,6,6}, {97,5,6,6}, {109,3,6,8}, {157,2,3,12}, {163,1,9,9}, {193,6,6,11}, {277,4,6,15}, {397,3,8,18}.

%Y Cf. A181786, A210338.

%K nonn

%O 1,1

%A _Zak Seidov_, Mar 20 2012