cp's OEIS Frontend

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.

A014364 Aliquot sequence starting at 1074.

This page as a plain text file.
%I A014364 #30 Mar 29 2024 06:12:04
%S A014364 1074,1086,1098,1320,3000,6360,13080,26520,64200,136680,303960,668040,
%T A014364 1448760,2897880,6778920,14760600,31761720,75003840,189623520,
%U A014364 475142400,1262108388,1723154620,2250655556,1742856988
%N A014364 Aliquot sequence starting at 1074.
%D A014364 Richard K. Guy, Unsolved Problems in Number Theory, 3rd Edition, Springer, 2004, Section B6, pp. 92-95.
%H A014364 Amiram Eldar, <a href="/A014364/b014364.txt">Table of n, a(n) for n = 0..2194</a> (terms 0..881 from R. J. Mathar)
%H A014364 Christophe Clavier, <a href="http://christophe.clavier.free.fr/Aliquot/site/Aliquot.html">Aliquot Sequences</a>.
%H A014364 factordb.com, <a href="http://factordb.com/sequences.php?se=1&amp;aq=1074&amp;action=all">Aliquot sequence of 1074</a>.
%H A014364 Paul Zimmermann, <a href="http://www.loria.fr/~zimmerma/records/aliquot.html">Latest information</a>.
%H A014364 <a href="/index/Al#ALIQUOT">Index entries for sequences related to aliquot parts</a>.
%F A014364 a(n+1) = A000203(a(n))-a(n). - _R. J. Mathar_, Oct 08 2017
%t A014364 FixedPointList[If[# > 0, DivisorSigma[1, #] - #, 0] &, 1074, 100] (* _Jean-François Alcover_, Mar 28 2020 *)
%o A014364 (PARI) a(n, a=1074)={for(i=1, n, a=sigma(a)-a); a} \\ _M. F. Hasler_, Feb 24 2018
%Y A014364 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 A014364 Cf. A000203.
%K A014364 nonn
%O A014364 0,1
%A A014364 _Paul Zimmermann_