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 A260087 #16 Jul 15 2015 18:03:18 %S A260087 284,1210,2924,5564,6368,10856,14595,18416,66992,71145,76084,87633, %T A260087 88730,124155,123152,139815,153176,168730,176336,180848,203432,202444, %U A260087 365084,389924,430402,399592,455344,486178,514736,525915,669688,686072,652664,691256,712216,783556,796696,863835,901424,980984,1043096,1125765 %N A260087 Larger of amicable pair (x, y) as they are listed in A259933. %C A260087 Another version of A002046. %C A260087 First differs from A002046 at a(9). %H A260087 Laszlo Hars, <a href="https://www.mail-archive.com/julia-users@googlegroups.com/msg04022.html">Performance compared to mathematica</a> Julia-users (2014) %H A260087 Khelleos, <a href="http://www.cyberforum.ru/lisp/thread386611.html">Amicable numbers</a>, CyberForum.ru (2011) %H A260087 OEIS Wiki, <a href="https://oeis.org/wiki/Amicable_numbers">Amicable numbers</a> (This page needs work) %H A260087 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 A260087 a(n) = A259933(2n) = A259953(n) - A259933(2n-1) = A259953(n) - A260086(n). %Y A260087 Cf. A002046, A063990, A259180, A259933, A259953, A260086. %K A260087 nonn %O A260087 1,1 %A A260087 _Omar E. Pol_, Jul 15 2015