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 A322951 #18 Feb 16 2025 08:33:57 %S A322951 2,10,18,274,314,522,562,578,594,602,930,1074,23826,184554,1923378, %T A322951 2248914,2290722,3069362 %N A322951 Numbers k such that 319*2^k+1 is prime. %H A322951 Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a> %H A322951 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 A322951 Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a> %H A322951 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a> %H A322951 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ProthPrime.html">Proth Prime</a> %H A322951 <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 A322951 select(n->isprime(319*2^n+1),[$1..1000]); # _Muniru A Asiru_, Dec 31 2018 %t A322951 Select[Range[1000], PrimeQ[319*2^# + 1] &] (* _Robert Price_, Dec 31 2018 *) %Y A322951 Cf. A002255, A050527. %K A322951 nonn,more,hard %O A322951 1,1 %A A322951 _Robert Price_, Dec 31 2018 %E A322951 a(16)-a(17) from _Jeppe Stig Nielsen_, Feb 25 2020 %E A322951 a(18) from _Jeppe Stig Nielsen_, Dec 20 2024