login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096635 Let p = n-th prime == 7 mod 8 (A007522); a(n) = smallest prime q such that p is not a square mod q. 4

%I #7 Mar 13 2020 12:54:00

%S 5,3,7,3,3,11,5,5,11,3,3,7,5,3,3,7,3,3,5,3,3,7,5,3,5,3,3,5,13,3,3,5,3,

%T 17,5,3,3,3,3,11,5,3,17,3,7,5,5,3,3,3,7,7,5,3,5,3,7,5,3,5,11,3,3,5,3,

%U 5,3,3,5,11,5,3,13,3,3,7,7,11,3,3,3,3,5,3,7,5,19,3,5,3,3,3,5,3,7,3,5,3,13

%N Let p = n-th prime == 7 mod 8 (A007522); a(n) = smallest prime q such that p is not a square mod q.

%H Robert Israel, <a href="/A096635/b096635.txt">Table of n, a(n) for n = 1..10000</a>

%p P:= select(isprime, [seq(i,i=7..3000,8)]):

%p f:= proc(n) local p,q;

%p p:= P[n]; q:= 2;

%p while numtheory:-quadres(p,q)=1 do q:= nextprime(q) od;

%p q

%p end proc:

%p map(f, [$1..nops(P)]); # _Robert Israel_, Mar 13 2020

%t f[n_] := Block[{k = 2}, While[ JacobiSymbol[n, Prime[k]] == 1, k++ ]; Prime[k]]; f /@ Select[ Prime[ Range[435]], Mod[ #, 8] == 7 &]

%K nonn

%O 1,1

%A _Robert G. Wilson v_, Jun 24 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)