This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A264009 #22 Nov 25 2015 02:37:50 %S A264009 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 A264009 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 A264009 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 A264009 Table T(i,j) = nonnegative k at which lcm(i+k,j+k) reaches the minimum, read by antidiagonals (i>=1, j>=1). %C A264009 T(i,j) = T(j,i). %C A264009 T(i,j) <= |i-j|. %C A264009 If i divides j or vice versa, then T(i,j) = 0. %H A264009 Ivan Neretin, <a href="/A264009/b264009.txt">Table of n, a(n) for n = 1..8001</a> %H A264009 <a href="/index/Lc#lcm">Index entries for sequences related to lcm's</a> %e A264009 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 A264009 Cf. A003990. %K A264009 nonn,tabl %O A264009 1,30 %A A264009 _Ivan Neretin_, Oct 31 2015