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.

This page as a plain text file.
%I A139207 #8 Jun 24 2025 21:18:05
%S A139207 5,2,2947253997913233984847871999999,29,23,19,719,4989599,
%T A139207 39520825343999,11,11058645491711999,419,479001599,359,7,
%U A139207 860234568201646565394748723848806399999999
%N A139207 Smallest father factorial prime p of order n = smallest prime of the form (p!-n)/n where p is prime.
%C A139207 For smallest daughter factorial prime p of order n (smallest p such that (p!+n)/n = p!/n + 1 is prime) see A139074.
%C A139207 For smallest son factorial prime p of order n = smallest prime of the form (p!-n)/n where p is prime see A139206.
%C A139207 For more terms see A139206.
%t A139207 a = {}; Do[k = 1; While[ ! PrimeQ[(Prime[k]! - n)/n], k++ ]; Print[a]; AppendTo[a, (Prime[k]! - n)/n], {n, 1, 100}]; a
%Y A139207 Cf. A139074, A139189, A139190, A139191, A139192, A139193, A139194, A139195, A139196, A139197, A139198, A136019, A136020, A136026, A136027.
%K A139207 hard,nonn
%O A139207 1,1
%A A139207 _Artur Jasinski_, Apr 11 2008