A240113 Integers for which the smallest m in A040081 such that n*2^m - 1 is prime (A038699) increases.
1, 13, 23, 43, 59, 88, 127, 148, 659
Offset: 1
Links
- Wilfrid Keller, The Riesel Problem: Definition and Status
Programs
-
PARI
a=0; for(n=1, 148, m=0; while(!ispseudoprime(n*2^m-1), m++); if(m>a, a=m; print1(n, ", ")));
Comments