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”).

A178966
Primes of the form (2n-1)^(2n-1) mod 2^(2n-1).
1
3, 68491, 1472837, 20933977, 115763405909, 860612330076805920786264707, 295312333859267885313149356219, 3030645565448009172324576658633624992466799, 1438089684181622246462815859549895702132195129054882453928357949021844283495791173
OFFSET
1,1
COMMENTS
Primes for n's: 2, 10, 11, 13, 19, 46, 50, 72, 139, 162, 344, 739, 1757, 3439, (10000)..., .
MATHEMATICA
f[n_] := Block[{a = PowerMod[2 n - 1, 2 n - 1, 2^(2 n - 1)]}, If[ PrimeQ@ a, a, 0]]; k = 1; lst = {}; While[k < 100, a = f@ k; If[a != 0, AppendTo[lst, a]]; k++]; lst
pfQ[n_]:=Module[{c=2n-1}, PowerMod[c, c, 2^c]]; Select[Table[pfQ[n], {n, 200}], PrimeQ] (* Harvey P. Dale, Aug 31 2017 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved