login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214060 Least m>0 such that gcd(2*n-1+m, n-m) > 1. 2
1, 2, 1, 4, 1, 6, 1, 8, 1, 10, 1, 2, 1, 14, 1, 16, 1, 18, 1, 20, 1, 2, 1, 24, 1, 4, 1, 28, 1, 30, 1, 2, 1, 34, 1, 36, 1, 38, 1, 5, 1, 2, 1, 44, 1, 46, 1, 4, 1, 50, 1, 2, 1, 5, 1, 56, 1, 58, 1, 60, 1, 2, 1, 64, 1, 66, 1, 5, 1, 4, 1, 2, 1, 6, 1, 76, 1, 78, 1, 80, 1, 2, 1, 84, 1, 86, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Clark Kimberling, Table of n, a(n) for n = 1..1000

EXAMPLE

gcd(23+1,12-1) = 1 and gcd(23+2,12-2) > 1, so that a(12) = 2.

MATHEMATICA

b[n_] := 2*n - 1; c[n_] := n;

Table[m = 1; While[GCD[b[n] + m, c[n] - m] == 1, m++]; m, {n, 1, 150}]

CROSSREFS

Cf. A214057, A214061, A214062.

Sequence in context: A193267 A083258 A083259 * A009531 A124625 A318775

Adjacent sequences:  A214057 A214058 A214059 * A214061 A214062 A214063

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Jul 24 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 27 06:24 EDT 2019. Contains 323599 sequences. (Running on oeis4.)