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.

A256301 Least prime p such that p + k! is prime for all k = 2..n.

Original entry on oeis.org

2, 3, 5, 5, 17, 107, 107, 107, 107, 82954517, 82954517, 79017245897, 79017245897, 1490524895687, 13101487760627087
Offset: 1

Views

Author

M. F. Hasler, Apr 05 2015

Keywords

Comments

The function f(k;p) = p+(k+1)! could be called an example of a non-polynomial prime generating function.

Programs

  • PARI
    a(n)=forprime(p=1,,for(i=2,n,ispseudoprime(p+i!)||next(2));return(p))

Extensions

a(12)-a(14) from John Cerkan, Jul 28 2017
Erroneous a(12) deleted and new a(14) from Khalid Sabry, Jan 25 2020
a(15) from Giovanni Resta, Jan 28 2020