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 A322950 #7 Feb 16 2025 08:33:57 %S A322950 7,11,243,291,327,1211,7331,26775,101603,171071,284795,295195,323871, %T A322950 589755,833467,1047471 %N A322950 Numbers k such that 317*2^k+1 is prime. %H A322950 Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a> %H A322950 Ray Ballinger and Wilfrid Keller, <a href="http://www.prothsearch.com/riesel1a.html">List of primes k.2^n + 1 for 300 < k < 600</a> %H A322950 Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a> %H A322950 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a> %H A322950 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ProthPrime.html">Proth Prime</a> %H A322950 <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> %t A322950 Select[Range[1000], PrimeQ[317*2^# + 1] &] (* _Robert Price_, Dec 31 2018 *) %Y A322950 Cf. A002255,A050527. %K A322950 nonn,more,hard %O A322950 1,1 %A A322950 _Robert Price_, Dec 31 2018