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 A322916 #31 Feb 16 2025 08:33:57 %S A322916 1,2,5,8,9,10,13,17,21,30,38,93,125,140,170,178,181,394,453,588,1161, %T A322916 1221,1573,1665,1745,3613,3661,5750,6002,6198,6393,6764,7209,7514, %U A322916 9444,13034,15277,16070,20042,22970,22977,25674,28438,31040,35137,42410,60285 %N A322916 Numbers k such that 303*2^k+1 is prime. %H A322916 Jeppe Stig Nielsen, <a href="/A322916/b322916.txt">Table of n, a(n) for n = 1..76</a> (terms n = 1..68 from Robert Price) %H A322916 Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a> %H A322916 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 A322916 Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a> %H A322916 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a> %H A322916 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ProthPrime.html">Proth Prime</a> %H A322916 <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 A322916 select(n->isprime(303*2^n+1),[$1..1000]); # _Muniru A Asiru_, Dec 31 2018 %t A322916 Select[Range[1000], PrimeQ[303*2^# + 1] &] (* _Robert Price_, Dec 30 2018 *) %Y A322916 Cf. A002255, A050527. %K A322916 nonn,hard %O A322916 1,2 %A A322916 _Robert Price_, Dec 30 2018