login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A139075 Primes p arising in A139074. 30
3, 2, 3, 31, 1009, 2, 5702401, 631 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
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]
LINKS
MATHEMATICA
a = {}; Do[k = 1; While[ ! PrimeQ[(Prime[k]! + n)/n], k++ ]; AppendTo[a, Prime[(Prime[k]! + n)/n]], {n, 1, 8}]; a
CROSSREFS
Sequence in context: A091806 A248244 A139170 * A089750 A109591 A143932
KEYWORD
nonn
AUTHOR
Artur Jasinski, Apr 08 2008, Apr 21 2008
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 13:17 EDT 2024. Contains 371254 sequences. (Running on oeis4.)