cp's OEIS Frontend

A217466 Primes p such that 2^p == 2 (mod p*(p+1)).

%I A217466 #19 Mar 25 2021 16:56:51
%S A217466 5,13,29,37,61,73,157,181,193,277,313,397,421,457,541,613,661,673,733,
%T A217466 757,877,997,1093,1153,1201,1213,1237,1289,1321,1381,1453,1621,1657,
%U A217466 1753,1873,1933,1993,2017,2137,2341,2473,2557,2593,2797,2857,2917,3061
%N A217466 Primes p such that 2^p == 2 (mod p*(p+1)).
%C A217466 Primes in A216822.
%H A217466 V. Raman, <a href="/A217466/b217466.txt">Table of n, a(n) for n = 1..10000</a>
%H A217466 Mersenne Forum, <a href="http://mersenneforum.org/showthread.php?t=17198"> Prime Conjecture </a>
%t A217466 Select[Prime[Range[500]],PowerMod[2,#,#(#+1)]==2&] (* _Harvey P. Dale_, Mar 25 2019 *)
%o A217466 (PARI) for(n=1,10000,if((2^n)%(n*(n+1))==2&&isprime(n),printf(n",")))
%o A217466 (Python)
%o A217466 from sympy import primerange
%o A217466 A217466_list = [p for p in primerange(1,10**6) if pow(2,p,p*(p+1)) == 2] # _Chai Wah Wu_, Mar 25 2021
%Y A217466 Cf. A216822.
%K A217466 nonn
%O A217466 1,1
%A A217466 _V. Raman_, Oct 04 2012