The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A257886 Least positive m such that floor(n! / (2*(floor(n/2)!))) + m is prime. 0
 2, 1, 2, 1, 1, 1, 1, 13, 1, 1, 29, 1, 1, 37, 29, 17, 31, 71, 71, 37, 23, 1, 37, 1, 41, 41, 31, 31, 59, 31, 41, 41, 41, 41, 41, 37, 41, 193, 83, 41, 53, 67, 149, 97, 59, 73, 113, 107, 137, 59, 137, 67, 101, 83, 73, 101, 241, 71, 73, 79, 83, 227, 199, 223, 127, 83, 83, 181, 227, 149, 103, 1, 587, 179, 229, 167, 127, 163, 109, 83 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Conjecture: No term is composite (similar conjecture to A033932 for a different expression). LINKS David Morales Marciel, About Fortunate numbers and other similar expressions EXAMPLE n = 1, floor(1! / (2*(floor(1/2)!)))=0, m = 2, and 0+2=2 is prime. n = 2, floor(2! / (2*(floor(2/2)!)))=1, m = 1, and 1+1=2 is prime. ... n = 15, floor(15! / (2*(floor(15/2)!)))=129729600, m = 29, and 129729600+29 = 129729629 is prime. MATHEMATICA lpm[n_]:=Module[{c=Floor[n!/(2Floor[n/2]!)]}, NextPrime[c]-c]; Array[lpm, 80] (* Harvey P. Dale, May 15 2018 *) PROG (Python) from sympy import factorial, nextprime [(nextprime(int(factorial(n)/(2*factorial(n//2)))))-int(factorial(n)/(2*factorial(n//2))) for n in range(1, 10**5)] CROSSREFS Cf. A033932. Sequence in context: A266649 A159847 A327489 * A144477 A106345 A319395 Adjacent sequences:  A257883 A257884 A257885 * A257887 A257888 A257889 KEYWORD nonn AUTHOR David Morales Marciel, May 11 2015 EXTENSIONS Edited. Wolfdieter Lang, Jun 08 2015 STATUS approved

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 September 19 16:34 EDT 2021. Contains 347564 sequences. (Running on oeis4.)