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 A322964 #7 Feb 16 2025 08:33:57 %S A322964 2,20,22,46,58,226,3760,7060,16192,22018,35576,103952,113326,120716, %T A322964 285122,543148,785510,1033126 %N A322964 Numbers k such that 343*2^k+1 is prime. %H A322964 Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a> %H A322964 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 A322964 Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a> %H A322964 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a> %H A322964 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ProthPrime.html">Proth Prime</a> %H A322964 <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> %p A322964 select(n->isprime(343*2^n+1),[$1..1000]); # _Muniru A Asiru_, Dec 31 2018 %t A322964 Select[Range[1000], PrimeQ[343*2^# + 1] &] (* _Robert Price_, Dec 31 2018 *) %Y A322964 Cf. A002255, A050527. %K A322964 nonn,more,hard %O A322964 1,1 %A A322964 _Robert Price_, Dec 31 2018