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 A323759 #15 Feb 18 2019 05:30:09
%S A323759 126,378,1260,3780,4584,5544,11424,16632,16728,49308,68760,73962,
%T A323759 88608,179118,168730,212160,225096,256338,266568,250920,365700,374304,
%U A323759 391656,374418,387720,386568,393528,548550,827700,739620,827652,932100,912288,935400,1052088
%N A323759 Larger of modified exponential amicable pairs.
%C A323759 A modified exponential amicable pair (m, n) has A241405(m) = A241405(n) = m + n + 1.
%C A323759 The lesser counterparts are in A323758.
%H A323759 Amiram Eldar, <a href="/A323759/b323759.txt">Table of n, a(n) for n = 1..4725</a> (terms whose lesser counterparts below 2*10^11)
%H A323759 David Moews, <a href="http://djm.cc/amicable.html">Perfect, amicable and sociable numbers</a>.
%t A323759 f[p_, e_] := DivisorSum[e+1, p^(#-1)&]; mesigma[1]=1; mesigma[n_] := Times @@ f @@@FactorInteger@ n; s={}; mes[n_] := mesigma[n]-n; Do[m=mes[n]; If[m>n && mes[m]==n, AppendTo[s, m]], {n,1,10000}]; s
%o A323759 (PARI) f(n) = {my(f=factor(n)); prod(i=1, #f[, 1], sumdiv(f[i, 2]+1, d, f[i, 1]^(d-1)));} \\ A241405
%o A323759 fm(n) = f(n) - n;
%o A323759 isok(n) = my(fn=fm(n)); (fn > 0) && (fn < n) && (fm(fn) == n); \\ _Michel Marcus_, Jan 30 2019
%Y A323759 Cf. A241405, A323757, A323758.
%K A323759 nonn
%O A323759 1,1
%A A323759 _Amiram Eldar_, Jan 26 2019