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 A322963 #11 Feb 16 2025 08:33:57 %S A322963 1,3,7,19,21,33,43,99,183,235,499,579,1137,1225,1941,1987,2409,3285, %T A322963 9093,9121,11043,14997,17919,31543,57163,83595,127915,129199,220651, %U A322963 384961,1255881,1325277,1728697,3300789,3686613,3938565 %N A322963 Numbers k such that 341*2^k+1 is prime. %H A322963 Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a> %H A322963 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 A322963 Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a> %H A322963 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a> %H A322963 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ProthPrime.html">Proth Prime</a> %H A322963 <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 A322963 select(n->isprime(341*2^n+1),[$1..1000]); # _Muniru A Asiru_, Dec 31 2018 %t A322963 Select[Range[1000], PrimeQ[341*2^# + 1] &] (* _Robert Price_, Dec 31 2018 *) %Y A322963 Cf. A002255, A050527. %K A322963 nonn,more,hard %O A322963 1,2 %A A322963 _Robert Price_, Dec 31 2018 %E A322963 a(34)-a(36) from _Jeppe Stig Nielsen_, Dec 20 2024