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 A285119 #15 Dec 12 2023 14:17:42
%S A285119 0,2,6,0,20,6,42,16,0,15,110,12,156,7,30,0,272,9,342,20,84,33,506,20,
%T A285119 0,65,162,84,812,30,930,128,176,153,70,0,1332,209,182,6,1640,42,1806,
%U A285119 110,132,345,2162,96,0,250,170,78,2756,162,330,56,152,609,3422
%N A285119 Min(|d(k+1-i) - d(i)|, for i = 1..k), where d(1)..d(k) are the divisors of n^3.
%C A285119 a(n) = 0 if and only if n is a square (A000290).
%H A285119 Clark Kimberling, <a href="/A285119/b285119.txt">Table of n, a(n) for n = 1..10000</a>
%F A285119 a(n) = A056737(A000578(n)).
%e A285119 3^3 = 27 has divisors 1,3,9,27, so that k=4 and d(k+1-i) - d(i) ranges through {-26,-6,6,27}, so that a(3) = 6.
%t A285119 f[n_] := f[n] = n^3; Table[Divisors[f[n]] - Reverse[Divisors[f[n]]], {n, 1, 10}]
%t A285119 Table[Min[Abs[Divisors[f[n]] - Reverse[Divisors[f[n]]]]], {n, 1, 100}]
%o A285119 (PARI) a(n) = my(d=divisors(n^3)); vecmin(apply(abs, d - Vecrev(d))); \\ _Michel Marcus_, Feb 22 2021
%Y A285119 Cf. A002378, A000578, A056737.
%K A285119 nonn,look,easy
%O A285119 1,2
%A A285119 _Clark Kimberling_, Apr 11 2017