OFFSET
1,1
COMMENTS
Primes p such that the sum of (q^2 mod p) for primes q < p is prime.
LINKS
Robert Israel, Table of n, a(n) for n = 1..3700
EXAMPLE
MAPLE
N:= 1000: # for terms in the first N primes
P:= [seq(ithprime(i), i=1..N)]:
R:= NULL:
for n from 1 to N do
v:= add(P[i]^2 mod P[n], i=1..n-1);
if isprime(v) then R:= R, P[n] fi
od:
R;
CROSSREFS
KEYWORD
nonn
AUTHOR
J. M. Bergot and Robert Israel, Nov 10 2020
STATUS
approved