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 A322955 #11 Feb 16 2025 08:33:57 %S A322955 2,14,18,32,42,72,144,174,282,318,828,1338,2154,2750,4034,9858,13692, %T A322955 49052,63522,86784,117162,126014,273090,302574,413862,901902,3231474, %U A322955 4097700 %N A322955 Numbers k such that 325*2^k+1 is prime. %H A322955 Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a> %H A322955 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 A322955 Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a> %H A322955 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a> %H A322955 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ProthPrime.html">Proth Prime</a> %H A322955 <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 A322955 select(n->isprime(325*2^n+1),[$1..1000]); # _Muniru A Asiru_, Dec 31 2018 %t A322955 Select[Range[1000], PrimeQ[325*2^# + 1] &] (* _Robert Price_, Dec 31 2018 *) %Y A322955 Cf. A002255, A050527. %K A322955 nonn,more,hard %O A322955 1,1 %A A322955 _Robert Price_, Dec 31 2018 %E A322955 a(27)-a(28) from _Jeppe Stig Nielsen_, Dec 20 2024