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 A032373 #25 Sep 19 2019 03:32:47 %S A032373 583,1483,6115 %N A032373 Numbers k such that 47*2^k+1 is prime. %C A032373 Next term >= 4100000. - _Joerg Arndt_, Apr 07 2013 %H A032373 Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a> %H A032373 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 A032373 Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a> %H A032373 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a> %H A032373 <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 A032373 (PARI) is(n)=ispseudoprime(47*2^n+1) \\ _Charles R Greathouse IV_, Feb 20 2017 %K A032373 nonn,hard,bref %O A032373 1,1 %A A032373 _James R. Buddenhagen_