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 A259305 #13 Jul 21 2016 02:46:29
%S A259305 756000,1220940,1437480,1973160,5019840,9058140,9703260,11058480,
%T A259305 11641680,13085280,17089920,18117000,19370880,21282912,21628080,
%U A259305 25295760,25585560,26936640,27763560,28191240,29104200,29203020,30450420,32839560,33279120,33398820
%N A259305 Numbers n such that there exists an x!=n that makes {x,x,x,n} an amicable multiset.
%C A259305 We call the multiset {x,x,x,n} amicable iff sigma(x)=sigma(n)=x+x+x+n.
%C A259305 For the x values, see A259304.
%C A259305 If the condition x!=n were dropped, the terms from A027687 would also belong here.
%H A259305 John Cerkan, <a href="/A259305/b259305.txt">Table of n, a(n) for n = 1..1000</a>
%o A259305 (PARI) isOK(n) = x=(sigma(n)-n)/3; x>0&x!=n&denominator(x)==1&sigma(x)==3*x+n
%Y A259305 Cf. A027687, A259307, A259304, A259302, A259303, A259306, A036471.
%K A259305 nonn
%O A259305 1,1
%A A259305 _Jeppe Stig Nielsen_, Jun 23 2015