| Equivalently, prime numbers which cannot be written as sum of squares of primes (see A078137 for the proof). - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), 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 (Hieronymus.Fischer(AT)gmx.de), Nov 11 2007
The sequence is finite, since numbers > 23 can be written as sums of squares >1 (see A078135). - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), 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 (Hieronymus.Fischer(AT)gmx.de), Nov 11 2007
| 