OFFSET
0,1
COMMENTS
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
FORMULA
a(n+1) = A001065(a(n)). - R. J. Mathar, Oct 11 2017
a(n) = A008885(n+1). - R. J. Mathar, Jan 12 2024
MAPLE
f := proc(n) option remember; if n = 0 then 42; else sigma(f(n-1))-f(n-1); fi; end:
MATHEMATICA
Join[NestList[DivisorSigma[1, #]-#&, 42, 14], PadRight[{}, 60, 0]] (* Harvey P. Dale, Apr 28 2014 *)
PROG
(PARI) a(n, a=42)={for(i=1, n, a=sigma(a)-a); a} \\ M. F. Hasler, Feb 24 2018
CROSSREFS
KEYWORD
nonn,fini,full
AUTHOR
EXTENSIONS
Edited by M. F. Hasler, Feb 24 2018
STATUS
approved