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 A282669 #32 Jan 27 2025 21:01:02 %S A282669 5,11,17,251,563,21011 %N A282669 Prime numbers p > 3 such that 2^p - 9 is prime. %C A282669 Let W = 2^p - 9 and s = (W+7)/(2*p), then 3^s == 4 (mod W) for terms 1..6. %C A282669 a(7) > 3480081 using A059610. - _Michael S. Branicky_, Jan 27 2025 %t A282669 Select[Prime[Range[3,565]],PrimeQ[2^#-9]&] (* The program generates the first five terms of the sequence. *) (* _Harvey P. Dale_, Aug 24 2024 *) %o A282669 (PARI) %o A282669 forprime(p=5, 10^5, W= 2^p-9; if(ispseudoprime(W), print1(p, ", "))) %Y A282669 Prime terms of A059610. %K A282669 nonn,more %O A282669 1,1 %A A282669 _Dmitry Ezhov_, Mar 07 2017