Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134056
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134056 Least positive integer k such that (n!)! + k is prime. +0
1
1, 1, 7, 131, 131, 2897, 21997 (list; graph; listen)
OFFSET

1,3

COMMENT

The terms beyond a(3), found by PrimeForm, produce probable primes of lengths 24, 199, 1747 and 16474 digits. As both (8!)! and 2*((8!)!) each have the same number of digits, a(8) will correspond to a 168187-digit prime (by Bertrand's Postulate). For all n, if k > 1, then k >= nextprime(n!). As (8!)!+1 is composite, a(8) >= 40343.

EXAMPLE

a(3) = 7 as (3!)! + 7 = 6! + 7 = 720 + 7 = 727 is the smallest prime larger than (3!)!.

CROSSREFS

Sequence in context: A077586 A002614 A095885 this_sequence A123036 A142011 A074224

Adjacent sequences: A134053 A134054 A134055 this_sequence A134057 A134058 A134059

KEYWORD

hard,more,nonn

AUTHOR

Rick L. Shepherd (rshepherd2(AT)hotmail.com), Oct 04 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research