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 A273970 #19 Jul 27 2016 21:55:22
%S A273970 695520,753480,1113840,1136520,1784160,2313360,2898720,3140280,
%T A273970 3865680,3960600,4272840,4500720,4626720,6126120,6167700,7197960,
%U A273970 7442820,7731360,8177400,8498700,8784720,8828820,8920800,8966160,9124920,9232860,9664200,9729720
%N A273970 Numbers x such that there exist a pair y, n with x < y, x != n and y != n that makes {x,y,n,n} an amicable multiset.
%C A273970 We call the multiset {x,y,n,n} amicable iff sigma(x) = sigma(y) = sigma(n) = x+y+n+n. For the n values, see A273969. For the y values, see A273971.
%C A273970 If the condition x<y were dropped, the terms from A259306 would also belong here.
%H A273970 John Cerkan, <a href="/A273970/b273970.txt">Table of n, a(n) for n = 1..8060</a>
%H A273970 John Cerkan, <a href="/A273970/a273970.py.txt">Python code</a>
%e A273970 sigma(695520) = sigma(803040) = sigma(702240) = 695520 + 803040 + 702240 + 702240.
%Y A273970 Cf. A259302, A259303, A259304, A259305, A259306, A273969, A273971.
%K A273970 nonn
%O A273970 1,1
%A A273970 _John Cerkan_, Jul 17 2016