This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A240113 #7 Dec 20 2018 12:45:08 %S A240113 1,13,23,43,59,88,127,148,659 %N A240113 Integers for which the smallest m in A040081 such that n*2^m - 1 is prime (A038699) increases. %C A240113 Where records occur in A040081. A103963 gives the record values. %C A240113 The next candidate is 2293. %H A240113 Wilfrid Keller, <a href="http://www.prothsearch.com/rieselprob.html">The Riesel Problem: Definition and Status</a> %o A240113 (PARI) a=0; for(n=1, 148, m=0; while(!ispseudoprime(n*2^m-1), m++); if(m>a, a=m; print1(n, ", "))); %Y A240113 Cf. A038699, A040081, A103963. %K A240113 nonn,more %O A240113 1,2 %A A240113 _Arkadiusz Wesolowski_, Apr 01 2014