The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A217466 Primes p such that 2^p == 2 (mod p*(p+1)). 3
 5, 13, 29, 37, 61, 73, 157, 181, 193, 277, 313, 397, 421, 457, 541, 613, 661, 673, 733, 757, 877, 997, 1093, 1153, 1201, 1213, 1237, 1289, 1321, 1381, 1453, 1621, 1657, 1753, 1873, 1933, 1993, 2017, 2137, 2341, 2473, 2557, 2593, 2797, 2857, 2917, 3061 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Primes in A216822. LINKS V. Raman, Table of n, a(n) for n = 1..10000 Mersenne Forum, Prime Conjecture MATHEMATICA Select[Prime[Range[500]], PowerMod[2, #, #(#+1)]==2&] (* Harvey P. Dale, Mar 25 2019 *) PROG (PARI) for(n=1, 10000, if((2^n)%(n*(n+1))==2&&isprime(n), printf(n", "))) CROSSREFS Cf. A216822. Sequence in context: A294919 A213050 A216822 * A078598 A155054 A158756 Adjacent sequences:  A217463 A217464 A217465 * A217467 A217468 A217469 KEYWORD nonn AUTHOR V. Raman, Oct 04 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 7 10:34 EDT 2020. Contains 336275 sequences. (Running on oeis4.)