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.

A098567 Smallest prime p such that p# + Mersenne-prime(n) is prime.

Original entry on oeis.org

2, 3, 3, 5, 5, 5, 7, 7, 31, 5, 59, 5, 11, 137, 397, 211, 2851, 601, 373, 271, 17467, 127, 1657, 52951, 6547, 11971, 37489
Offset: 1

Views

Author

Pierre CAMI, Sep 15 2004

Keywords

Crossrefs

Programs

  • Mathematica
    f[p_] := Module[{k = 2, q = 2}, While[!PrimeQ[k + p], q = NextPrime[q]; k *= q]; q]; f /@ (2^MersennePrimeExponent[Range[10]] - 1) (* Amiram Eldar, Jul 23 2021 *)

Extensions

a(21)-a(27) from Amiram Eldar, Jul 23 2021