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 A322946 #17 Feb 16 2025 08:33:57 %S A322946 9,29,35,105,125,131,179,359,2735,28199,47349,64485,1094135,1171199, %T A322946 1323071,2798459,3037565,3270759,3282455 %N A322946 Numbers k such that 311*2^k+1 is prime. %H A322946 Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a> %H A322946 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 A322946 Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a> %H A322946 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a> %H A322946 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ProthPrime.html">Proth Prime</a> %H A322946 <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> %t A322946 Select[Range[1000], PrimeQ[311*2^# + 1] &] (* _Robert Price_, Dec 31 2018 *) %Y A322946 Cf. A002255, A050527. %K A322946 nonn,more,hard %O A322946 1,1 %A A322946 _Robert Price_, Dec 31 2018 %E A322946 a(16) from _Jeppe Stig Nielsen_, Dec 27 2019 %E A322946 a(17)-a(20) from _Jeppe Stig Nielsen_, Dec 20 2024