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 A259302 #14 Jul 06 2016 17:50:50
%S A259302 1740,7776,19260,20640,21384,21924,22428,25830,31440,55968,93024,
%T A259302 101010,106140,143910,151164,198792,246510,309582,326196,411138,
%U A259302 421596,428256,499464,590112,639288,697158,870552,941094,958716,1060956,1068210,1087776,1100640
%N A259302 Numbers n such that there exists an x!=n that makes {n,n,x} an amicable multiset.
%C A259302 We call the multiset {n,n,x} amicable iff sigma(n)=sigma(x)=n+n+x.
%C A259302 For the x values, see A259303.
%C A259302 If the condition x!=n were dropped, the terms from A005820 would also belong here.
%H A259302 John Cerkan, <a href="/A259302/b259302.txt">Table of n, a(n) for n = 1..1689</a>
%o A259302 (PARI) isOK(n) = x=sigma(n)-2*n; x>0 && x!=n && sigma(x)==n+n+x;
%Y A259302 Cf. A005820, A259307, A259303, A259304, A259305, A259306, A125490.
%K A259302 nonn
%O A259302 1,1
%A A259302 _Jeppe Stig Nielsen_, Jun 23 2015