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 A322959 #7 Feb 16 2025 08:33:57 %S A322959 5,6,9,18,25,33,50,54,69,70,101,153,176,245,401,448,745,768,806,840, %T A322959 1338,1718,3504,4164,5581,5729,6010,6705,8076,10233,12169,13345,55285, %U A322959 58138,113589,197820,203453,238130,364946,817201,1068320,1708106,1837105 %N A322959 Numbers k such that 333*2^k+1 is prime. %H A322959 Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a> %H A322959 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 A322959 Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a> %H A322959 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a> %H A322959 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ProthPrime.html">Proth Prime</a> %H A322959 <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 A322959 select(n->isprime(333*2^n+1),[$1..1000]); # _Muniru A Asiru_, Dec 31 2018 %t A322959 Select[Range[1000], PrimeQ[333*2^# + 1] &] (* _Robert Price_, Dec 31 2018 *) %Y A322959 Cf. A002255, A050527. %K A322959 nonn,more,hard %O A322959 1,1 %A A322959 _Robert Price_, Dec 31 2018