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.

A139075 Primes p arising in A139074.

Original entry on oeis.org

3, 2, 3, 31, 1009, 2, 5702401, 631
Offset: 1

Views

Author

Artur Jasinski, Apr 08 2008, Apr 21 2008

Keywords

Comments

a(23) = (23+1579!)/23. - Andrew V. Sutherland, Apr 11 2008.
Smallest mother factorial prime p of order n, i.e. smallest prime of the form (p!+n)/n where p is prime.
For smallest daughter factorial prime p of order n see A139074.
For smallest father factorial prime p of order n see A139207.
For smallest son factorial prime p of order n see A139206.
a(9)=26737!/9+1 is a 106758 digit (probable) prime. Easily calculated but too large to enter here a(10)=13, a(11)=566092801, a(12)=11. [Robert Price, Jan 19 2011]

Crossrefs

Programs

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