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 A014365 #24 Mar 29 2024 06:13:42
%S A014365 1134,1770,2550,4146,4158,7362,8628,11532,16272,29670,46362,46374,
%T A014365 48666,48678,70362,86118,92058,95622,95634,180846,246834,381006,
%U A014365 460458,562902,612138,612150,1316298,1350582,1509690,3086790
%N A014365 Aliquot sequence starting at 1134.
%D A014365 Richard K. Guy, Unsolved Problems in Number Theory, 3rd Edition, Springer, 2004, Section B6, pp. 92-95.
%H A014365 Amiram Eldar, <a href="/A014365/b014365.txt">Table of n, a(n) for n = 0..3839</a> (terms 0..3568 from Robert G. Wilson v)
%H A014365 Christophe Clavier, <a href="http://christophe.clavier.free.fr/Aliquot/site/Aliquot.html">Aliquot Sequences</a>.
%H A014365 factordb.com, <a href="http://factordb.com/sequences.php?se=1&aq=1134&action=all">Aliquot sequence of 1134</a>.
%H A014365 Robert G. Wilson v, <a href="/A014365/a014365.txt">terms n = 0..3568 with factorization</a>.
%H A014365 Paul Zimmermann, <a href="http://www.loria.fr/~zimmerma/records/aliquot.html">Latest information</a>.
%H A014365 <a href="/index/Al#ALIQUOT">Index entries for sequences related to aliquot parts</a>.
%F A014365 a(n+1) = A001065(a(n)). - _R. J. Mathar_, Oct 11 2017
%t A014365 f[n_] := DivisorSigma[1, n] - n; NestList[f, 1134, 100] (* _Robert G. Wilson v_, Dec 22 2012 *)
%o A014365 (PARI) a(n, a=1134)={for(i=1, n, a=sigma(a)-a); a} \\ _M. F. Hasler_, Feb 25 2018
%Y A014365 Cf. A098007 (length of aliquot sequences); some other examples: A008885 (starting at 30) .. A008892 (starting at 276), A014360 (starting at 552) .. A014364 (starting at 1074), see link to index for a more complete list.
%Y A014365 Cf. A001065.
%K A014365 nonn
%O A014365 0,1
%A A014365 _Paul Zimmermann_