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 A339679 #8 Dec 13 2020 05:13:44
%S A339679 284,1210,6368,10856,14595,71145,87633,525915,1438983,1870245,5120595,
%T A339679 6088905,11791935,14084763,36939357,207429525,234587199,662939925,
%U A339679 1337154465,2450161791,4024393191,4785272037,10162493523,38437212933,160412122575,229777289469,248806975131
%N A339679 Larger of amicable pair (a, b) such that the sum of their number of divisors d(a) + d(b) sets a new record.
%C A339679 The terms are ordered according to their lesser counterparts (A339678).
%C A339679 The terms were calculated using data from Chernykh's site.
%H A339679 Amiram Eldar, <a href="/A339679/b339679.txt">Table of n, a(n) for n = 1..55</a>
%H A339679 Sergei Chernykh, <a href="http://sech.me/ap/">Amicable pairs list</a>.
%t A339679 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, m]], {n,1 ,10^6}]; seq
%Y A339679 Cf. A000005, A002025, A002046, A063990, A328043, A339678.
%K A339679 nonn
%O A339679 1,1
%A A339679 _Amiram Eldar_, Dec 12 2020