This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A053714 #11 Jul 24 2014 10:40:10 %S A053714 1,1,1,-1,7,-1,-1,23,-13,11,1,-1,-23,-1,43,23,31,37,89,29,31,31,-89, %T A053714 -73,41,-37,1,67,-31,-1,-61,-1,-1,97,61,-127,1,-1,-73,53,1,-79,71,47, %U A053714 -53,-89,-79,53,-59,61,-179,53,-59,-127,-61,149,107,-109,-137,-139,-71,-71,-101,67,-127,283,73,83,-103,-97,-751,101 %N A053714 Smallest (in magnitude) nonzero number m such that n!+m is prime. %C A053714 a(n) is the defined, nonzero (thus excluding a(1) and a(2) of A033933) minimum of A033932(n) and A033933(n) multiplied by -1 if that minimum is not A033932(n). If n!+m and n!-m are equidistant primes (A053709), we have (arbitrarily) chosen positive m. %H A053714 Hans Havermann, <a href="/A053714/b053714.txt">Table of n, a(n) for n = 1..2000</a> %e A053714 For n=4, the possible m are -1 (24-1) and +5 (24+5). The former is closer to 4! so a(4) is -1. %e A053714 For n=5, the possible m are -7 (120-7) and +7 (120+7). Being equidistant to 5!, a(5) is +7. %Y A053714 Cf. A006990, A037151, A033932, A033933, A053709, A056752 (unsigned version with a different second term). %K A053714 sign %O A053714 1,5 %A A053714 _Labos Elemer_, Feb 10 2000 %E A053714 Edited by _Hans Havermann_, Jul 23 2014