|
%I #45 Sep 08 2022 08:44:55
%S 2,3,5,11,17,23,29,41,47,53,59,71,83,89,101,107,113,131,137,149,167,
%T 173,179,191,197,227,233,239,251,257,263,269,281,293,311,317,347,353,
%U 359,383,389,401,419,431,443,449,461,467,479,491,503,509,521,557,563
%N Primes congruent to {0, 2} mod 3.
%C Also, primes p such that the equation x^3 == y (mod p) has a unique solution x for every choice of y. - _Klaus Brockhaus_, Mar 02 2001; Michel Drouzy (DrouzyM(AT)noos.fr), Oct 28 2001
%H Vincenzo Librandi, <a href="/A045309/b045309.txt">Table of n, a(n) for n = 1..1000</a>
%F a(n) ~ 2n log n. - _Charles R Greathouse IV_, Apr 20 2015
%t Select[Prime[Range[150]],MemberQ[{0,2},Mod[#,3]]&] (* _Harvey P. Dale_, Jun 14 2011 *)
%o (Magma) [ p: p in PrimesUpTo(1000) | #[ x: x in ResidueClassRing(p) | x^3 eq 2 ] eq 1 ]; // _Klaus Brockhaus_, Apr 11 2009
%o (PARI) is(n)=isprime(n) && n%3!=1 \\ _Charles R Greathouse IV_, Apr 20 2015
%Y Cf. A040028, A014752, A060121, A003627, A007528, A045410.
%K nonn,easy
%O 1,1
%A _N. J. A. Sloane_
%E Edited by _N. J. A. Sloane_, Apr 11 2009
|
