OFFSET
1,1
COMMENTS
These primes are the exceptional primes p == 3 (mod 4) that do not admit a representation of the form p = u*(u+1) + v*(v+1) +-1.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
For p = 47 == 3 (mod 4), we have 2p-1 = 93, which is not a sum of two squares. But 2p+3 = 97 = 9^2 + 4^2 is a sum of two squares, so 47 is not in this sequence.
For p = 107 == 3 (mod 4), we compute 2p-1 = 213 and 2p+3 = 217. Neither 213 nor 217 is a sum of two squares. Therefore 107 is in this sequence.
MAPLE
ns2:= proc(n)
ormap(t -> t[1] mod 4 = 3 and t[2]::odd, ifactors(n)[2])
end proc:
filter:= n -> isprime(n) and ns2(2*n-1) and ns2(2*n+3):
select(filter, [seq(i, i=3..4000, 4)]); # Robert Israel, Sep 04 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Charles Kusniec, Aug 25 2025
STATUS
approved
