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 A322961 #14 Feb 16 2025 08:33:57 %S A322961 4,6,10,26,64,66,70,102,322,370,570,1750,1782,1974,2482,6886,7782, %T A322961 9784,20476,34826,37546,46566,47800,132962,184230,257930,286554, %U A322961 370274,544852,648856,2585660,2750860,3274106 %N A322961 Numbers k such that 337*2^k+1 is prime. %H A322961 Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a> %H A322961 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 A322961 Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a> %H A322961 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a> %H A322961 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ProthPrime.html">Proth Prime</a> %H A322961 <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 A322961 select(n->isprime(337*2^n+1),[$1..1000]); # _Muniru A Asiru_, Dec 31 2018 %t A322961 Select[Range[1000], PrimeQ[337*2^# + 1] &] (* _Robert Price_, Dec 31 2018 *) %Y A322961 Cf. A002255, A050527. %K A322961 nonn,more,hard %O A322961 1,1 %A A322961 _Robert Price_, Dec 31 2018 %E A322961 a(31)-a(32) from _Jeppe Stig Nielsen_, Dec 27 2019 %E A322961 a(33) from _Jeppe Stig Nielsen_, Dec 20 2024