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 A322922 #23 Feb 16 2025 08:33:57 %S A322922 3,7,21,23,29,35,53,87,91,95,115,165,179,233,367,419,609,791,2937, %T A322922 3713,4087,5071,6497,30011,30783,32861,48299,60155,143623,293525, %U A322922 465959,567161,975215,1024223,1106333,1285643,1597089,2233655,2733989,2840155,3171039 %N A322922 Numbers k such that 305*2^k+1 is prime. %H A322922 Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a> %H A322922 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 A322922 Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a> %H A322922 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a> %H A322922 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ProthPrime.html">Proth Prime</a> %H A322922 <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 A322922 Select[Range[1000], PrimeQ[305*2^# + 1] &] (* _Robert Price_, Dec 30 2018 *) %Y A322922 Cf. A002255, A050527. %K A322922 nonn,more,hard %O A322922 1,1 %A A322922 _Robert Price_, Dec 30 2018 %E A322922 a(38)-a(39) from _Jeppe Stig Nielsen_, Dec 27 2019 %E A322922 a(40) from _Jeppe Stig Nielsen_, Feb 05 2020 %E A322922 a(41) from _Jeppe Stig Nielsen_, Dec 20 2024