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 A285121 #16 Dec 12 2023 14:16:59
%S A285121 0,0,3,1,2,1,5,2,4,9,9,12,22,8,14,10,32,8,3,9,54,2,4,2,20,11,5,12,114,
%T A285121 18,26,20,8,1,31,35,210,9,48,58,244,68,19,17,26,90,90,0,56,40,115,3,6,
%U A285121 3,36,51,492,91,173,89,34,25,2,12,192,81,257,8
%N A285121 Min(|d(k+1-i) - d(i)|, for i = 1..k), where d(1),..,d(k) are the divisors of n*(n+1)*(n+2)/6.
%H A285121 Clark Kimberling, <a href="/A285121/b285121.txt">Table of n, a(n) for n = 1..9998</a>
%F A285121 a(n) = A056737(A000292(n)).
%e A285121 6(6+1)(6+2)/6 = 56 has divisors 1,2,4,7,8,14,28,56, so that k=8 and d(k+1-i) - d(i) ranges through {-55, -26, -10, -1, 1, 10, 26, 55}, so that a(6) = 1.
%t A285121 f[n_] := f[n] = n(n+1)(n+2)/6;
%t A285121 Table[Divisors[f[n]] - Reverse[Divisors[f[n]]], {n, 1, 10}]
%t A285121 Table[Min[Abs[Divisors[f[n]] - Reverse[Divisors[f[n]]]]], {n, 1, 100}]
%Y A285121 Cf. A000292, A002378, A056737.
%K A285121 nonn,easy
%O A285121 1,3
%A A285121 _Clark Kimberling_, Apr 11 2017
%E A285121 Two extraneous 0's removed by _Pontus von Brömssen_, Jul 15 2023