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

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, 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, 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

Offset: 1

Author

Ivan Neretin, Oct 31 2015

Keywords

• nonn
• tabl

Comments

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

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

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

Examples

			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.
		

Links

• Ivan Neretin, Table of n, a(n) for n = 1..8001
• Index entries for sequences related to lcm's

Crossrefs

Cf. A003990.