|
%I #29 Dec 25 2023 12:50:51
%S 193,257,449,577,641,769,1153,1217,1409,1601,2113,2689,2753,3137,3329,
%T 3457,4289,4481,4673,4801,4993,5441,5569,5953,6337,6529,6977,7297,
%U 7489,7681,7873,7937,8513,8641,9281,9473,9601,9857,10177,10369,10433,10753,11329
%N Primes congruent to 1 mod 64.
%C Odd primes p such that -1 is a 32nd power mod p. - _Eric M. Schmidt_, Mar 27 2014
%H Reinhard Zumkeller, <a href="/A142925/b142925.txt">Table of n, a(n) for n = 1..10000</a>
%t lst={};Do[p=Prime[n];If[Mod[p,64]==1,AppendTo[lst,p]],{n,7!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Feb 26 2009 *)
%t Select[Prime[Range[1800]], MemberQ[{1}, Mod[#, 64]] &] (* _Vincenzo Librandi_, Sep 06 2012 *)
%t Select[Range[1,12000,64],PrimeQ] (* _Harvey P. Dale_, Dec 25 2023 *)
%o (Haskell)
%o a142925 n = a142925_list !! (n-1)
%o a142925_list = filter ((== 1) . a010051) [1,65..]
%o -- _Reinhard Zumkeller_, Mar 06 2012
%o (Magma) [p: p in PrimesUpTo(12000) | p mod 64 eq 1 ] ; // _Vincenzo Librandi_, Sep 06 2012
%o (PARI) is(n)=isprime(n) && n%64==1 \\ _Charles R Greathouse IV_, Jul 01 2016
%Y Cf. A000040, A065091, A002144, A007519, A094407, A133870, A208177, A208178, A076339.
%K nonn,easy
%O 1,1
%A _N. J. A. Sloane_, Jul 11 2008
|
