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 A014362 #33 Mar 15 2025 17:34:54 %S A014362 660,1356,1836,3204,4986,5856,9768,17592,26448,47952,94586,47296, %T A014362 46684,42524,31900,46220,50884,38170,36998,22810,18266,9136,8596,8652, %U A014362 14644,14700,34776,80424,137586,149838,194898,230478,236082 %N A014362 Aliquot sequence starting at 660. %D A014362 Richard K. Guy, Unsolved Problems in Number Theory, 3rd Edition, Springer, 2004, Section B6, pp. 92-95. %H A014362 Tyler Busby, <a href="/A014362/b014362.txt">Table of n, a(n) for n = 0..1074</a> (from factordb.com; terms 0..268 from T. D. Noe, terms 269..1008 from Amiram Eldar) %H A014362 Christophe Clavier, <a href="http://christophe.clavier.free.fr/Aliquot/site/Aliquot.html">Aliquot Sequences</a>. %H A014362 factordb.com, <a href="http://factordb.com/sequences.php?se=1&aq=660&action=all">Aliquot sequence of 660</a>. %H A014362 Paul Zimmermann, <a href="http://www.loria.fr/~zimmerma/records/aliquot.html">Latest information</a>. %H A014362 <a href="/index/Al#ALIQUOT">Index entries for sequences related to aliquot parts</a>. %F A014362 a(n+1) = A001065(a(n)). - _R. J. Mathar_, Oct 11 2017 %t A014362 FixedPointList[If[# > 0, DivisorSigma[1, #] - #, 0]&, 660, 100] (* _Jean-François Alcover_, Mar 28 2020 *) %Y A014362 Cf. A001065, A014361, A014363. %K A014362 nonn %O A014362 0,1 %A A014362 _Paul Zimmermann_