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.

Showing 1-2 of 2 results.

A249383 Smallest odd prime number Q such that Q*2^P-1 is also prime with P Mersenne prime exponent A000043(n).

Original entry on oeis.org

3, 3, 7, 3, 31, 7, 61, 43, 79, 19, 739, 103, 2707, 4513, 139, 13, 4027, 28027, 14029, 87151, 11257, 8677, 122449, 104161, 113287, 216211, 150097, 862009, 876721, 414949, 4590451, 1391281
Offset: 1

Views

Author

Pierre CAMI, Oct 27 2014

Keywords

Comments

a(32) is a 227838-digit certified prime.
Does a(n) exist for each n? - Charles R Greathouse IV, Oct 28 2014

Crossrefs

Programs

  • PARI
    lista(nn) = {vmp = readvec("b000043.txt"); for (n=1, nn, k=2; while(!isprime(prime(k)*2^vmp[n]-1), k++); print1(prime(k), ", "););} \\ Michel Marcus, Oct 27 2014

A249384 Smallest odd prime number Q such that Q*2^P+1 is also prime, where P is a Mersenne prime exponent A000043(n).

Original entry on oeis.org

3, 5, 3, 5, 5, 53, 11, 239, 53, 191, 1229, 5, 233, 347, 1367, 9767, 2063, 89, 14009, 3329, 19991, 50849, 2711, 337871, 46301, 2543, 413093, 1157111, 615161, 1138649, 3778427
Offset: 1

Views

Author

Pierre CAMI, Oct 27 2014

Keywords

Crossrefs

Programs

  • PARI
    lista(nn) = {vmp = readvec("b000043.txt"); for (n=1, nn, k=2; while(!isprime(prime(k)*2^vmp[n]+1), k++); print1(prime(k), ", "););} \\ Michel Marcus, Oct 27 2014
Showing 1-2 of 2 results.