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 A322915 #12 Feb 16 2025 08:33:57 %S A322915 4,184,344,352,392,1060,2452,7360,9736,10324,21316,22752,27272,27744, %T A322915 28068,55628,72864,88472,95872,124628,218584,424448,517960,880792, %U A322915 1455620,3284232 %N A322915 Numbers k such that 301*2^k+1 is prime. %H A322915 Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a> %H A322915 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 A322915 Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a> %H A322915 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a> %H A322915 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ProthPrime.html">Proth Prime</a> %H A322915 <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 A322915 Select[Range[1000], PrimeQ[301*2^# + 1] &] (* _Robert Price_, Dec 30 2018 *) %Y A322915 Cf. A002255, A050527. %K A322915 nonn,hard,more %O A322915 1,1 %A A322915 _Robert Price_, Dec 30 2018 %E A322915 a(26) from _Jeppe Stig Nielsen_, Dec 20 2024