cp's OEIS Frontend

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.

A283266 Prime numbers p such that 2^p - 3 is prime.

Original entry on oeis.org

3, 5, 29, 233, 42689, 69337
Offset: 1

Views

Author

Dmitry Ezhov, Mar 04 2017

Keywords

Comments

Let W = 2^p - 3 and s = (W+1)/(2*p), then 3^s == -2 (mod W) for terms 1..6.
a(7) > 2086750 using A050414. - Michael S. Branicky, Jan 27 2025

Crossrefs

Prime terms in A050414.

Programs

  • PARI
    forprime(p=2, 10^5, W= 2^p-3; if(ispseudoprime(W), print1(p, ", ")))