login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A142925
Primes congruent to 1 mod 64.
10
193, 257, 449, 577, 641, 769, 1153, 1217, 1409, 1601, 2113, 2689, 2753, 3137, 3329, 3457, 4289, 4481, 4673, 4801, 4993, 5441, 5569, 5953, 6337, 6529, 6977, 7297, 7489, 7681, 7873, 7937, 8513, 8641, 9281, 9473, 9601, 9857, 10177, 10369, 10433, 10753, 11329
OFFSET
1,1
COMMENTS
Odd primes p such that -1 is a 32nd power mod p. - Eric M. Schmidt, Mar 27 2014
LINKS
MATHEMATICA
lst={}; Do[p=Prime[n]; If[Mod[p, 64]==1, AppendTo[lst, p]], {n, 7!}]; lst (* Vladimir Joseph Stephan Orlovsky, Feb 26 2009 *)
Select[Prime[Range[1800]], MemberQ[{1}, Mod[#, 64]] &] (* Vincenzo Librandi, Sep 06 2012 *)
Select[Range[1, 12000, 64], PrimeQ] (* Harvey P. Dale, Dec 25 2023 *)
PROG
(Haskell)
a142925 n = a142925_list !! (n-1)
a142925_list = filter ((== 1) . a010051) [1, 65..]
-- Reinhard Zumkeller, Mar 06 2012
(Magma) [p: p in PrimesUpTo(12000) | p mod 64 eq 1 ] ; // Vincenzo Librandi, Sep 06 2012
(PARI) is(n)=isprime(n) && n%64==1 \\ Charles R Greathouse IV, Jul 01 2016
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jul 11 2008
STATUS
approved