cp's OEIS Frontend

A096638 Smallest prime p == 3 mod 8 (A007520) and p > prime(n+2) such that p is a quadratic residue mod the first n odd primes 3, 5, 7, 11, ..., prime(n+1), and p is a quadratic non-residue mod prime(n+2).

%I A096638 #10 Mar 07 2013 17:12:19
%S A096638 11,43,19,211,331,2011,1171,7459,10651,18379,90931,257371,399499,
%T A096638 1234531,6938779,3574411,14669251,39803611,102808099,288710899,
%U A096638 322503091,465390979,1582819291,2410622971,505313251
%N A096638 Smallest prime p == 3 mod 8 (A007520) and p > prime(n+2) such that p is a quadratic residue mod the first n odd primes 3, 5, 7, 11, ..., prime(n+1), and p is a quadratic non-residue mod prime(n+2).
%C A096638 Same as smallest prime p == 3 mod 8 with the property that the Legendre symbol (p|q) = 1 for the first n odd primes q = prime(k+1), k = 1, 2, ..., n, and (p|q) = -1 for q = prime(n+2).
%t A096638 f[n_] := Block[{k = 2}, While[ JacobiSymbol[n, Prime[k]] == 1, k++ ]; Prime[k]]; t = Table[0, {50}]; Do[p = Prime[n]; If[Mod[p, 8] == 3, a = f[p]; If[ t[[ PrimePi[a]]] == 0, t[[ PrimePi[a]]] = p; Print[ PrimePi[a], " = ", p]]], {n, 10^9}]; t
%Y A096638 Cf. A096633, A096636.
%K A096638 nonn
%O A096638 0,1
%A A096638 _Robert G. Wilson v_, Jun 24 2004
%E A096638 Better name from _Jonathan Sondow_, Mar 07 2013