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 A339678 #11 Dec 13 2020 05:13:29
%S A339678 220,1184,6232,10744,12285,67095,69615,522405,1175265,1798875,4482765,
%T A339678 5730615,9773505,10634085,34765731,203972715,211319745,558410475,
%U A339678 1131258975,2221700481,3900906009,4416880923,9357224877,36853129467,139043711025,200453238531,200795248485
%N A339678 Lesser of amicable pair (a, b) such that the sum of their number of divisors d(a) + d(b) sets a new record.
%C A339678 The larger counterparts are in A339679.
%C A339678 The corresponding sums of numbers of divisors are 18, 24, 28, 32, 48, 64, 72, ... (see the link for more values).
%C A339678 The terms were calculated using data from Chernykh's site.
%H A339678 Amiram Eldar, <a href="/A339678/b339678.txt">Table of n, a(n) for n = 1..55</a>
%H A339678 Sergei Chernykh, <a href="http://sech.me/ap/">Amicable pairs list</a>.
%H A339678 Amiram Eldar, <a href="/A339678/a339678.txt">Table of n, a(n), A339679(n), A000005(a(n)) + A000005(A339679(n)) for n = 1..55</a>
%e A339678 The least pair of amicable numbers, (220, 284), has a sum of numbers of divisors d(220) + d(284) = 12 + 6 = 18.
%e A339678 The second pair, (1184, 1210) has a larger sum: d(1184) + d(1210) = 12 + 12 = 24.
%e A339678 The next pair with a larger sum is (6232, 6368) whose sum is d(6232) + d(6368) = 16 + 12 = 28.
%t A339678 s[n_] := DivisorSigma[1, n] - n; dm = 0; seq = {}; Do[m = s[n]; If[m > n && s[m] == n && (d = Plus @@ DivisorSigma[0,{n, m}]) > dm, dm = d; AppendTo[seq, n]], {n,1 ,10^6}]; seq
%Y A339678 Cf. A000005, A002025, A002046, A063990, A328043, A339679.
%K A339678 nonn
%O A339678 1,1
%A A339678 _Amiram Eldar_, Dec 12 2020