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!)
A240113 Integers for which the smallest m in A040081 such that n*2^m - 1 is prime (A038699) increases. 1

%I #7 Dec 20 2018 12:45:08

%S 1,13,23,43,59,88,127,148,659

%N Integers for which the smallest m in A040081 such that n*2^m - 1 is prime (A038699) increases.

%C Where records occur in A040081. A103963 gives the record values.

%C The next candidate is 2293.

%H Wilfrid Keller, <a href="http://www.prothsearch.com/rieselprob.html">The Riesel Problem: Definition and Status</a>

%o (PARI) a=0; for(n=1, 148, m=0; while(!ispseudoprime(n*2^m-1), m++); if(m>a, a=m; print1(n, ", ")));

%Y Cf. A038699, A040081, A103963.

%K nonn,more

%O 1,2

%A _Arkadiusz Wesolowski_, Apr 01 2014

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 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)