|
%I #6 Jul 30 2012 17:47:40
%S 1,2,1,4,1,6,1,3,1,10,1,12,1,14,1,2,1,3,1,20,1,22,1,24,1,26,1,3,1,2,1,
%T 32,1,34,1,36,1,3,1,7,1,42,1,2,1,46,1,3,1,50,1,52,1,54,1,4,1,2,1,60,1,
%U 7,1,64,1,66,1,3,1,70,1,2,1,74,1,76,1,3,1,80,1
%N Least m>0 such that 2*n+1+m and n-m are not relatively prime.
%H Clark Kimberling, <a href="/A214721/b214721.txt">Table of n, a(n) for n = 1..1000</a>
%e gcd(17,7) = 1, gcd(19,6) = 1, gcd(20,5) = 5, so a(8) = 3.
%t Table[m = 1; While[GCD[2n+1+m, n - m] != 1, m++]; m, {n, 1, 140}]
%Y Cf. A214060.
%K nonn,easy
%O 1,2
%A _Clark Kimberling_, Jul 28 2012
|
