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!)
A067363 a(n)=p-n!^3, where p is the smallest prime > n!^3+1. 4
2, 3, 7, 5, 17, 11, 17, 23, 23, 103, 59, 17, 29, 79, 59, 23, 347, 307, 53, 227, 131, 83, 67, 223, 29, 59, 197, 83, 181, 293, 71, 71, 139, 43, 67, 103, 431, 743, 1279, 197, 419, 127, 271, 73, 229, 503, 211, 181, 1597, 151, 151, 197, 1013, 179, 587, 71, 137, 547 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The first 118 terms are primes. Are all terms prime? For n!^i, with 0<i<6, it looks like the terms are prime, too (see references). But for n!^6: a(28)=1189=29*41.
The first 2278 terms are primes. - Dana Jacobsen, May 13 2015
LINKS
Cyril Banderier, Fortunate Numbers
MATHEMATICA
a[n_] := For[i=2, True, i++, If[PrimeQ[n!^3+i], Return[i]]]
spn[n_]:=Module[{c=(n!)^3}, NextPrime[c+1]-c]; Array[spn, 60] (* Harvey P. Dale, May 25 2023 *)
PROG
(MuPAD) for n from 1 to 50 do f := n!^3:a := nextprime(f+2)-f:print(a) end_for
(PARI) for(n=1, 100, f=n!^3; print1(nextprime(f+2)-f, ", ")) \\ Dana Jacobsen, May 13 2015
(Perl) use ntheory ":all"; use Math::GMP qw/:constant/; for my $n (1..500) { my $f=factorial($n)**3; say "$n ", next_prime($f+1)-$f; } # Dana Jacobsen, May 13 2015
CROSSREFS
Sequence in context: A294205 A059459 A124440 * A083188 A370094 A228775
KEYWORD
nonn
AUTHOR
Frank Buss (fb(AT)frank-buss.de), Jan 19 2002
EXTENSIONS
Edited by Dean Hickerson, Mar 02 2002
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 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)