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 A322962 #14 Feb 16 2025 08:33:57 %S A322962 3,11,17,21,26,50,62,125,165,278,290,1227,1275,1325,2153,2450,2811, %T A322962 3327,5921,6321,7095,8657,8786,9687,12221,14163,30686,63975,73767, %U A322962 132551,356991,364797,442065,464483,559637,632297,972755,1685135,2408337,3974295,4592225 %N A322962 Numbers k such that 339*2^k+1 is prime. %H A322962 Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a> %H A322962 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 A322962 Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a> %H A322962 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a> %H A322962 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ProthPrime.html">Proth Prime</a> %H A322962 <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 A322962 select(n->isprime(339*2^n+1),[$1..1000]); # _Muniru A Asiru_, Dec 31 2018 %t A322962 Select[Range[1000], PrimeQ[339*2^# + 1] &] (* _Robert Price_, Dec 31 2018 *) %Y A322962 Cf. A002255, A050527. %K A322962 nonn,more,hard %O A322962 1,1 %A A322962 _Robert Price_, Dec 31 2018 %E A322962 a(39) from _Jeppe Stig Nielsen_, Jan 04 2020 %E A322962 a(40)-a(41) from _Jeppe Stig Nielsen_, Dec 20 2024