|
|
A211349
|
|
Primes p such that p-1 divides 2^p + 2.
|
|
4
|
|
|
2, 3, 11, 251, 5051, 16811, 2025251, 8751251, 16607051, 28257611, 69005051, 78906251, 176775251, 210381251, 372175451, 550427051, 707025251, 854704451, 1866788051, 2441406251, 2605806251, 4249701251, 5469531251, 9304386251, 10315761251, 10915095251
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
Select[Prime[Range[1000]], Mod[2^# + 2, # - 1] == 0 &]
|
|
PROG
|
(PARI)
N=10^9;
default(primelimit, N);
forprime(p=2, N, if (-2==Mod(2, p-1)^p, print1(p, ", ")));
(Python)
from sympy import primerange
A211349_list = [p for p in primerange(1, 10**6) if p == 2 or pow(2, p, p-1) == p-3] # Chai Wah Wu, Mar 25 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|