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”).

A078139
Primes which cannot be written as sum of squares>1.
8
2, 3, 5, 7, 11, 19, 23
OFFSET
1,1
COMMENTS
Equivalently, prime numbers which cannot be written as sum of squares of primes (see A078137 for the proof). - Hieronymus Fischer, Nov 11 2007
Equivalently, prime numbers which cannot be written as sum of squares of 2 and 3 (see A078137 for the proof). - Hieronymus Fischer, Nov 11 2007
The sequence is finite, since numbers > 23 can be written as sums of squares >1 (see A078135). - Hieronymus Fischer, Nov 11 2007
Explicit representation as sum of squares of primes, or rather of squares of 2 and 3, for numbers m>23: we have m=c*2^2+d*3^2, where c:=((floor(m/4) - 2*(m mod 4))>=0, d:=m mod 4. For that, the finiteness of the sequence is proved. - Hieronymus Fischer, Nov 11 2007
KEYWORD
nonn,fini,full
AUTHOR
Reinhard Zumkeller, Nov 19 2002
STATUS
approved