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 A322948 #15 Feb 16 2025 08:33:57 %S A322948 4,10,16,24,70,184,250,432,460,792,8482,9868,10954,14098,16260,17770, %T A322948 19354,81504,85672,158662,166354,188914,327924,337942,424318,519748, %U A322948 621432,888288,1949544,3716716,3837304,3869536 %N A322948 Numbers k such that 313*2^k+1 is prime. %H A322948 Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a> %H A322948 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 A322948 Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a> %H A322948 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a> %H A322948 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ProthPrime.html">Proth Prime</a> %H A322948 <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 A322948 select(n->isprime(313*2^n+1),[$1..1000]); # _Muniru A Asiru_, Dec 31 2018 %t A322948 Select[Range[1000], PrimeQ[313*2^# + 1] &] (* _Robert Price_, Dec 31 2018 *) %Y A322948 Cf. A002255, A050527. %K A322948 nonn,more,hard %O A322948 1,1 %A A322948 _Robert Price_, Dec 31 2018 %E A322948 a(30)-a(32) from _Jeppe Stig Nielsen_, Dec 20 2024