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 A032420 #37 Dec 23 2024 11:36:47 %S A032420 1,3,5,7,8,12,15,20,31,33,37,41,61,65,91,93,103,117,133,137,141,160, %T A032420 291,303,343,488,535,555,556,640,756,897,917,1745,1805,2053,2372,3375, %U A032420 5952,9612,15717,18432,25593,29212,31004,31135,32192,32287,43477,44901 %N A032420 Numbers k such that 141*2^k+1 is prime. %H A032420 Jeppe Stig Nielsen, <a href="/A032420/b032420.txt">Table of n, a(n) for n = 1..87</a> (terms n = 1..78 from Robert Price) %H A032420 Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a> %H A032420 Ray Ballinger and Wilfrid Keller, <a href="http://www.prothsearch.com/riesel1.html">List of primes k.2^n + 1 for k < 300</a> %H A032420 Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a> %H A032420 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a> %H A032420 <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 A032420 select(k->isprime(141*2^k+1),[$0..400])[]; # _Muniru A Asiru_, Dec 18 2018 %t A032420 Select[Range[1000], PrimeQ[141*2^# + 1] & ] (* _Robert Price_, Dec 18 2018 *) %o A032420 (PARI) is(n)=ispseudoprime(141*2^n+1) \\ _Charles R Greathouse IV_, Jun 07 2017 %K A032420 nonn %O A032420 1,2 %A A032420 _James R. Buddenhagen_ %E A032420 a(51)-a(78) from the Ray Ballinger and Wilfrid Keller link by _Robert Price_, Dec 18 2018