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 A322956 #7 Feb 16 2025 08:33:57 %S A322956 3,4,6,15,30,64,99,108,135,363,414,531,576,811,1326,1414,1476,1936, %T A322956 2371,3951,4195,13324,21696,23203,35790,46950,51756,55174,61876,92487, %U A322956 134104,691951,706915,1743751 %N A322956 Numbers k such that 327*2^k+1 is prime. %H A322956 Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a> %H A322956 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 A322956 Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a> %H A322956 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a> %H A322956 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ProthPrime.html">Proth Prime</a> %H A322956 <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 A322956 select(n->isprime(327*2^n+1),[$1..1000]); # _Muniru A Asiru_, Dec 31 2018 %t A322956 Select[Range[1000], PrimeQ[327*2^# + 1] &] (* _Robert Price_, Dec 31 2018 *) %Y A322956 Cf. A002255, A050527. %K A322956 nonn,more,hard %O A322956 1,1 %A A322956 _Robert Price_, Dec 31 2018