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 A001773 M2686 N1076 #40 Nov 06 2023 14:59:00 %S A001773 3,7,23,287,291,795,2203,5711,7927,9443,10095,19071,29611,34651,51875, %T A001773 55343,77511,166303,233207 %N A001773 Numbers k such that 13*2^k - 1 is prime. %D A001773 H. Riesel, "Prime numbers and computer methods for factorization", Progress in Mathematics, Vol. 57, Birkhäuser, Boston, 1985, Chap. 4, see pp. 381-384. %D A001773 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A001773 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A001773 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 A001773 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a> %H A001773 H. C. Williams and C. R. Zarnke, <a href="http://dx.doi.org/10.1090/S0025-5718-1968-0227095-2">A report on prime numbers of the forms M = (6a+1)*2^(2m-1)-1 and (6a-1)*2^(2m)-1</a>, Math. Comp., 22 (1968), 420-422. %H A001773 <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> %o A001773 (PARI) is(n)=ispseudoprime(13*2^n-1) \\ _Charles R Greathouse IV_, May 22 2017 %Y A001773 Cf. A032356 (13*2^k+1 is prime). %K A001773 hard,nonn,more %O A001773 1,1 %A A001773 _N. J. A. Sloane_ %E A001773 More terms from _Hugo Pfoertner_, Jun 23 2004