|
|
A033217
|
|
Primes of form x^2 + 23*y^2.
|
|
6
|
|
|
23, 59, 101, 167, 173, 211, 223, 271, 307, 317, 347, 449, 463, 593, 599, 607, 691, 719, 809, 821, 829, 853, 877, 883, 991, 997, 1097, 1117, 1151, 1163, 1181, 1231, 1319, 1451, 1453, 1481, 1553, 1613, 1669, 1697, 1787, 1789, 1867, 1871, 1879, 1889, 1913, 2027, 2053, 2143, 2309, 2339, 2347, 2381, 2393, 2423, 2539, 2647, 2677, 2693, 2707, 2741, 2819
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Discriminant -23.
Also primes of the form x^2 - x*y + 6*y^2 with x and y nonnegative. - T. D. Noe, May 07 2005
Primes p such that X^3-X+1 is split modulo p. E.g., X^3-X+1 = (X-33)*(X-40)*(X-94) modulo 167. - Julien Freslon (julien.freslon(AT)wanadoo.fr), Feb 24 2007
In fact, this sequence appears to be the same as primes p such that RamanujanTau(p) == {1,2} (mod 23). - Ray Chandler, Dec 01 2016
|
|
REFERENCES
|
David A. Cox, "Primes of the Form x^2 + n y^2", Wiley, 1989.
Joe Roberts, Lure of the Integers, "Integer 23 - the Tau function".
|
|
LINKS
|
|
|
MATHEMATICA
|
QuadPrimes2[1, 0, 23, 10000] (* see A106856 *)
Join[{23}, nn=23; pMax=5000; Union[Reap[Do[p=x^2 + nn y^2; If[p<=pMax&&PrimeQ[p], Sow[p]], {x, Sqrt[pMax]}, {y, Sqrt[pMax/nn]}]][[2, 1]]]] (* Vincenzo Librandi, Sep 05 2016 *)
|
|
PROG
|
(PARI) isok(p) = isprime(p) && !(kronecker(-23, p)==-1) && !polisirreducible(Mod(1, p)*(x^3-x-1)); \\ Arkadiusz Wesolowski, Oct 03 2021
(PARI) isok(p) = p==23 || (isprime(p) && #polrootsmod(x^3-x-1, p)==3); \\ Arkadiusz Wesolowski, Oct 09 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|