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 A283266 #10 Jan 27 2025 21:01:07 %S A283266 3,5,29,233,42689,69337 %N A283266 Prime numbers p such that 2^p - 3 is prime. %C A283266 Let W = 2^p - 3 and s = (W+1)/(2*p), then 3^s == -2 (mod W) for terms 1..6. %C A283266 a(7) > 2086750 using A050414. - _Michael S. Branicky_, Jan 27 2025 %o A283266 (PARI) %o A283266 forprime(p=2, 10^5, W= 2^p-3; if(ispseudoprime(W), print1(p, ", "))) %Y A283266 Prime terms in A050414. %K A283266 nonn,more %O A283266 1,1 %A A283266 _Dmitry Ezhov_, Mar 04 2017