%I #22 Nov 25 2015 02:37:50

%S 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0,1,0,1,0,0,0,3,0,0,0,0,

%T 3,0,0,0,1,0,0,0,1,0,0,0,5,2,2,0,0,2,2,5,0,0,0,0,0,1,0,1,0,0,0,0,0,1,

%U 4,1,1,0,0,1,1,4,1,0,0,0,1,2,3,0,0,0,3,2,1,0,0,0,9,0,3,0,0,0,0,0,0,3,0,9,0

%N Table T(i,j) = nonnegative k at which lcm(i+k,j+k) reaches the minimum, read by antidiagonals (i>=1, j>=1).

%C T(i,j) = T(j,i).

%C T(i,j) <= |i-j|.

%C If i divides j or vice versa, then T(i,j) = 0.

%H Ivan Neretin, <a href="/A264009/b264009.txt">Table of n, a(n) for n = 1..8001</a>

%H <a href="/index/Lc#lcm">Index entries for sequences related to lcm's</a>

%e Let i=10, j=3. Then lcm(i,j)=30, lcm(i+1,j+1)=44, lcm(i+2,j+2)=60, lcm(i+3,j+3)=78, and lcm(i+4,j+4)=14, which is the minimum. Hence T(10,3)=T(3,10)=4.

%Y Cf. A003990.

%K nonn,tabl

%O 1,30

%A _Ivan Neretin_, Oct 31 2015