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 A014361 #32 Mar 16 2025 11:57:19 %S A014361 564,780,1572,2124,3336,5064,7656,13944,26376,49464,88536,187944, %T A014361 295896,443904,812340,1652304,2767056,4803888,7914048,13495104, %U A014361 30725280,79741440,196505388,300216656,285162916,237325596,325831908,434442572,325831936,347001764,260735800,434766560 %N A014361 Aliquot sequence starting at 564. %D A014361 Richard K. Guy, Unsolved Problems in Number Theory, 3rd Edition, Springer, 2004, Section B6, pp. 92-95. %H A014361 Tyler Busby, <a href="/A014361/b014361.txt">Table of n, a(n) for n = 0..3493</a> (from factordb.com; terms 0..600 from T. D. Noe, terms 601..3486 from Amiram Eldar) %H A014361 Christophe Clavier, <a href="http://christophe.clavier.free.fr/Aliquot/site/Aliquot.html">Aliquot Sequences</a>. %H A014361 factordb.com, <a href="http://factordb.com/sequences.php?se=1&aq=564&action=all">Aliquot sequence of 564</a>. %H A014361 Paul Zimmermann, <a href="http://www.loria.fr/~zimmerma/records/aliquot.html">Latest information</a>. %H A014361 <a href="/index/Al#ALIQUOT">Index entries for sequences related to aliquot parts</a>. %F A014361 a(n+1) = A001065(a(n)). - _R. J. Mathar_, Oct 11 2017 %t A014361 FixedPointList[If[# > 0, DivisorSigma[1, #] - #, 0]&, 564, 100] (* _Jean-François Alcover_, Mar 28 2020 *) %o A014361 (PARI) a(n, a=564)={for(i=1, n, a=sigma(a)-a); a} \\ _M. F. Hasler_, Feb 24 2018 %Y A014361 Cf. A098007 (length of aliquot sequences); some other examples: A008885 (starting at 30) .. A008892 (starting at 276), A014360 (starting at 552) .. A014365 (starting at 1134), ..., A171103 (starting at 46758). See link to index for a more complete list. %Y A014361 Cf. A001065. %K A014361 nonn %O A014361 0,1 %A A014361 _Paul Zimmermann_