login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050596 Numbers n such that 141*2^n-1 is prime. 0

%I #18 Jan 17 2019 10:08:17

%S 1,2,7,10,11,13,38,46,61,170,299,445,815,983,4237,6146,7255,7459,7585,

%T 8411,8647,14855,20338,21671,29293,89318,92498,98686,121142,250271,

%U 619742

%N Numbers n such that 141*2^n-1 is prime.

%H Ray Ballinger and Wilfrid Keller, <a href="http://www.prothsearch.com/riesel1.html">List of primes k.2^n + 1 for k < 300</a>

%H Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a>

%H <a href="/index/Pri#riesel">Index entries for sequences of n such that k*2^n-1 (or k*2^n+1) is prime</a>

%H Kosmaj, <a href="http://www.15k.org/riesellist.html">Riesel list k<300</a>.

%o (PARI) is(n)=ispseudoprime(141*2^n-1) \\ _Charles R Greathouse IV_, Jun 13 2017

%K hard,nonn

%O 1,2

%A _N. J. A. Sloane_, Dec 29 1999

%E More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 02 2008

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 16:08 EDT 2024. Contains 371794 sequences. (Running on oeis4.)