OFFSET
0,1
COMMENTS
Start at 150, and repeatedly apply the map x -> Sum of divisors of x excluding x.
The sum-of-divisor function A000203 and aliquot parts A001065 are defined only for positive integers, so the trajectory ends when 0 is reached, here at index 14. - M. F. Hasler, Feb 24 2018
REFERENCES
R. K. Guy, Unsolved Problems in Number Theory, B6.
LINKS
Ivan Panchenko, Table of n, a(n) for n = 0..177 (full sequence).
Christophe CLAVIER, Aliquot Sequences
Factordb, Whole sequence starting with 150
FORMULA
a(n) = A008888(n+1). - R. J. Mathar, Oct 28 2008
MAPLE
f := proc(n) option remember; if n = 0 then 150; else sigma(f(n-1))-f(n-1); fi; end:
MATHEMATICA
FixedPointList[If[# > 0, DivisorSigma[1, #] - #, 0]&, 150] // Most (* Jean-François Alcover, Mar 28 2020 *)
PROG
(PARI) a(n, a=150)={for(i=1, n, a=sigma(a)-a); a} \\ M. F. Hasler, Feb 24 2018
CROSSREFS
KEYWORD
nonn,fini,full
AUTHOR
STATUS
approved