A163185 -id:A163185 - cp's OEIS frontend

A033203 Primes p congruent to {1, 2, 3} (mod 8); or primes p of form x^2 + 2*y^2; or primes p such that x^2 = -2 has a solution mod p.

2, 3, 11, 17, 19, 41, 43, 59, 67, 73, 83, 89, 97, 107, 113, 131, 137, 139, 163, 179, 193, 211, 227, 233, 241, 251, 257, 281, 283, 307, 313, 331, 337, 347, 353, 379, 401, 409, 419, 433, 443, 449, 457, 467, 491, 499, 521, 523, 547, 563, 569, 571, 577, 587, 593, 601, 617, 619, 641, 643, 659, 673, 683

Offset: 1

N. J. A. Sloane

Sequence naturally partitions into two sequences: all primes p with ord_p(-2) odd (A163183, the primes dividing 2^j +1 for some odd j) and certain primes p with ord_p(-2) even (A163185). - Christopher J. Smyth, Jul 23 2009

Terms m in A047476 with A010051(m) = 1. - Reinhard Zumkeller, Dec 29 2012

David A. Cox, "Primes of the Form x^2 + n y^2", Wiley, 1989.

Ray Chandler, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)
N. J. A. Sloane et al., Binary Quadratic Forms and OEIS (Index to related sequences, programs, references)

Cf. A002332, A002333.
Cf. A039706, A003628 (complement with respect to A000040).
Primes in A002479.
Cf. A051100 (see Mathar's comment).
Apart from leading term the same as A033200.

a033203 n = a033203_list !! (n-1)
a033203_list = filter ((== 1) . a010051) a047476_list
-- Reinhard Zumkeller, Dec 29 2012, Jan 22 2012

[p: p in PrimesUpTo(600) | p mod 8 in [1..3]]; // Vincenzo Librandi, Aug 11 2012

[p: p in PrimesUpTo(800) | NormEquation(2,p) eq true]; // Bruno Berselli, Jul 03 2016

QuadPrimes2[1, 0, 2, 10000] (* see A106856 *)
Select[Prime[Range[200]],MemberQ[{1,2,3},Mod[#,8]]&] (* Harvey P. Dale, Mar 16 2013 *)

is(n)=isprime(n) && issquare(Mod(-2,n)) \\ Charles R Greathouse IV, Nov 29 2016

a(n) = A002332(n) + 2*A002333(n)^2. - Zak Seidov, May 29 2014

A163186 Primes p such that the equation x^64 == -2 (mod p) has a solution, and ord_p(-2) is even.

Original entry on oeis.org

25601, 50177, 59393, 65537, 96001, 115201, 195457, 262657, 266369, 267649, 279553, 286721, 295937, 299393, 306689, 331777, 366593, 425857, 460289, 495617, 509569, 525313, 528001, 556289, 595073, 710273, 730753, 790529, 819457, 868993, 1021697, 1022977, 1049089

Offset: 1

Christopher J. Smyth, Jul 24 2009

Such primes are the exceptional p for which x^64 == -2 (mod p) has a solution, as x^64 == -2 (mod p) is soluble for *every* p with ord_p(-2) odd.
But if ord_p(-2) is even and p - 1 = 2^r.j with j odd, then x^64 == -2 (mod p) is soluble if and only if ord_p(-2) is not divisible by 2^(r-5). See comment at A163185 for explanation.
Most primes p for which x^64 == -2 (mod p) has a solution (A051101) have ord_p(-2) odd (so belong to A163183). Thus 25601 (first element of current sequence, and 827th element of A051101) is the first element where A051101 and A163183 differ.

			For p = 25601, 562^64 == -2 (mod p), the 2-power part of p-1 is 2^10 and ord_p(-2) = 400, which is even but has 2-power part 2^4, which is not divisible by 2^(10-5).

Jinyuan Wang, Table of n, a(n) for n = 1..1000

A051101 (all primes p for which x^62 == -2 (mod p) has a solution) is a union of A163183 (primes p with ord_p(-2) odd) and the current sequence.

with(numtheory):k:=6: A:=NULL:p:=2: for c to 30000 do p:=nextprime(p); o:=order(-2, p); R:=gcd(2^100, p-1); if o mod 2=0 and p mod 2^(k+1) = 1 and o mod R/2^(k-1)<>0 then A:=A, p; fi; od:A;

lista(nn) = forprime(p=3, nn, if(znorder(Mod(-2, p))%2==0 && []~!=polrootsmod(x^64+2, p), print1(p, ", "))); \\ Jinyuan Wang, Mar 24 2020

More terms from Jinyuan Wang, Mar 24 2020

cp's OEIS Frontend

A033203 Primes p congruent to {1, 2, 3} (mod 8); or primes p of form x^2 + 2*y^2; or primes p such that x^2 = -2 has a solution mod p.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Magma

Mathematica

PARI

Formula