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!)
 A214055 Least m>0 such that n!+2+m and n-m have a common divisor > 1. 1
 1, 2, 3, 1, 5, 2, 1, 2, 9, 1, 11, 2, 1, 2, 15, 1, 17, 2, 1, 2, 21, 1, 3, 2, 1, 2, 27, 1, 29, 2, 1, 2, 3, 1, 35, 2, 1, 2, 39, 1, 41, 2, 1, 2, 45, 1, 5, 2, 1, 2, 51, 1, 3, 2, 1, 2, 57, 1, 59, 2, 1, 2, 3, 1, 65, 2, 1, 2, 69, 1, 71, 2, 1, 2, 5, 1, 77, 2, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Clark Kimberling, Table of n, a(n) for n = 1..1000 EXAMPLE 6!+2+1=723, 6-1=5; 6!+2+2=724, 6-2=4; so a(6)=2. MATHEMATICA b[n_] := n! + 2; c[n_] := n; Table[m = 1; While[GCD[b[n] + m, c[n] - m] == 1, m++]; m, {n, 100}] CROSSREFS Cf. A020639, A060680. Sequence in context: A166333 A322966 A173239 * A066909 A095195 A229961 Adjacent sequences:  A214052 A214053 A214054 * A214056 A214057 A214058 KEYWORD nonn,easy AUTHOR Clark Kimberling, Jul 22 2012 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 May 9 10:29 EDT 2021. Contains 343732 sequences. (Running on oeis4.)