This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A067362 a(n) = p - n!^2, where p is the smallest prime > n!^2+1. 6

%I

%S 2,3,5,11,7,11,11,13,23,17,13,59,23,31,23,41,59,67,29,31,103,389,59,

%T 107,47,127,67,181,101,97,409,37,61,43,61,47,263,109,53,199,167,337,

%U 47,131,127,73,181,257,191,101,83,79,181,167,229,859,421,433,107,971

%N a(n) = p - n!^2, where p is the smallest prime > n!^2+1.

%C The first 157 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.

%C The first 200 terms are primes. - _Jon Perry_ and Christ van Willegen, Mar 07 2003

%C The first 3003 terms are primes. - _Dana Jacobsen_, May 13 2015

%H Dana Jacobsen, <a href="/A067362/b067362.txt">Table of n, a(n) for n = 1..3000</a>

%H Cyril Banderier, <a href="http://algo.inria.fr/banderier/Computations/prime_factorial.html">Fortunate Numbers</a>

%t a[n_] := For[i=2, True, i++, If[PrimeQ[n!^2+i], Return[i]]]

%t Table[p = NextPrime[(x = (n!)^2) + 1]; p - x, {n, 60}] (* _Jayanta Basu_, Aug 10 2013 *)

%o (MuPAD) for n from 1 to 50 do f := n!^2:a := nextprime(f+2)-f:print(a) end_for

%o (PARI) for(n=1,500,f=n!^2;print1(nextprime(f+2)-f, ", ")) \\ _Dana Jacobsen_, May 10 2015

%o (Perl) use ntheory ":all"; use Math::GMP qw/:constant/; for my \$n (1..500) { my \$f=factorial(\$n)**2; say "\$n ",next_prime(\$f+1)-\$f; } # _Dana Jacobsen_, May 10 2015

%Y Cf. A037153, A037153, A005235, A067363, A067364, A067365.

%K nonn

%O 1,1

%A Frank Buss (fb(AT)frank-buss.de), Jan 19 2002

%E Edited by _Dean Hickerson_, Mar 02 2002

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

Last modified May 22 19:19 EDT 2019. Contains 323481 sequences. (Running on oeis4.)