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.

A139207 Smallest father factorial prime p of order n = smallest prime of the form (p!-n)/n where p is prime.

Original entry on oeis.org

5, 2, 2947253997913233984847871999999, 29, 23, 19, 719, 4989599, 39520825343999, 11, 11058645491711999, 419, 479001599, 359, 7, 860234568201646565394748723848806399999999
Offset: 1

Views

Author

Artur Jasinski, Apr 11 2008

Keywords

Comments

For smallest daughter factorial prime p of order n (smallest p such that (p!+n)/n = p!/n + 1 is prime) see A139074.
For smallest son factorial prime p of order n = smallest prime of the form (p!-n)/n where p is prime see A139206.
For more terms see A139206.

Crossrefs

Programs

  • Mathematica
    a = {}; Do[k = 1; While[ ! PrimeQ[(Prime[k]! - n)/n], k++ ]; Print[a]; AppendTo[a, (Prime[k]! - n)/n], {n, 1, 100}]; a