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 A323754 #8 Feb 16 2019 21:11:21
%S A323754 100548,968436,5027400,48665232,48421800,468723024,845775504,
%T A323754 938024640,26989110720,40792003200,48200025744,63433162800,
%U A323754 303008547060
%N A323754 Larger member of primitive exponential amicable pairs.
%C A323754 The lesser counterparts are in A323753.
%C A323754 a(14) <= 647935817256.
%H A323754 Peter Hagis, Jr., <a href="http://dx.doi.org/10.1155/S0161171288000407">Some Results Concerning Exponential Divisors</a>, International Journal of Mathematics and Mathematical Sciences, Vol. 11, No. 2, (1988), pp. 343-350.
%H A323754 Jan Munch Pedersen, <a href="http://62.198.248.44/aliquot/knwne2.htm">Known Exponential Amicable Pairs</a>.
%e A323754 (90972 = 2^2*3^2*7*19^2, 100548 = 2^2*3^3*7^2*19) are a primitive pair since they are an exponential amicable pair (A126165, A126166) and they do not have a common prime divisor with multiplicity 1 in both.
%e A323754 (454860, 502740) = 5 * (90972, 100548) are not a primitive pair since 5 divides both of them only once.
%t A323754 rad[n_] := Times @@ First /@ FactorInteger[n]; pf[n_] := Denominator[n/rad[n]^2]; esigma[n_] := Times @@ (Sum[First[#]^d, {d, Divisors[Last[#]]}] &) /@ FactorInteger[n]; es[n_] := esigma[n] - n; s = {}; Do[m = es[n]; If[m > n && es[m] == n && CoprimeQ[pf[n], pf[m]], AppendTo[s, m]], {n, 1, 10^7}]; s (* after _Jean-François Alcover_ at A055231 and A051377 *)
%Y A323754 Cf. A051377, A054979, A049419, A054980, A126164, A126165, A126166, A126167, A323753.
%K A323754 nonn,more
%O A323754 1,1
%A A323754 _Amiram Eldar_, Jan 26 2019