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 A260086 #16 Jul 15 2015 18:03:06 %S A260086 220,1184,2620,5020,6232,10744,12285,17296,66928,67095,63020,69615, %T A260086 79750,100485,122368,122265,141664,142310,171856,176272,185368,196724, %U A260086 280540,308620,319950,356408,437456,469028,503056,522405,600392,609928,643336,624184,635624,667964,726104,802725,879712,898216,998104,947835 %N A260086 Smaller of amicable pair (x, y) as they are listed in A259933. %C A260086 Another version of A002025. %C A260086 First differs from A002025 at a(9). %H A260086 Laszlo Hars, <a href="https://www.mail-archive.com/julia-users@googlegroups.com/msg04022.html">Performance compared to mathematica</a> Julia-users (2014) %H A260086 Khelleos, <a href="http://www.cyberforum.ru/lisp/thread386611.html">Amicable numbers</a>, CyberForum.ru (2011) %H A260086 OEIS Wiki, <a href="https://oeis.org/wiki/Amicable_numbers">Amicable numbers</a> (This page needs work) %H A260086 Wikipédia, <a href="https://hu.wikipedia.org/wiki/Barátságos_számok">Barátságos számok</a> (contains a mistake: A063990 should be replaced with A259933) %F A260086 a(n) = A259933(2n-1) = A259953(n) - A259933(2n) = A259953(n) - A260087(n). %Y A260086 Cf. A002025, A063990, A259180, A259933, A259953, A260087. %K A260086 nonn %O A260086 1,1 %A A260086 _Omar E. Pol_, Jul 15 2015