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 A269542 #17 Oct 16 2023 16:13:51
%S A269542 702,978,990,1818,2160,5280,12864,21680,28912,31848,47832,71808,
%T A269542 148512,359520,946848,1895712,4539360,12180336,23781648,44267568,
%U A269542 76111632,139130668,104348008,92030552,80526748,62286692,55099864,51042536,47249404,35492780,39042100
%N A269542 Aliquot sequence starting at 702.
%C A269542 This sequence is one of the first ones that contains numbers that exceed 2^64 and yet is known to terminate in a small prime followed by 1 and 0.
%C A269542 Note how all the numbers in the sequence are even, except the last 6 (not counting 0).
%D A269542 R. K. Guy, Unsolved Problems in Number Theory, B6.
%D A269542 Enoch Haga, Exploring Prime Numbers on Your PC, 2nd ed., 1998, pages 83-84 and Table 8, page 46. ISBN 1-885794-16-9.
%H A269542 Daniel Mondot, <a href="/A269542/b269542.txt">Table of n, a(n) for n = 0..301</a>
%F A269542 a(n+1) = A001065(a(n)). - _R. J. Mathar_, Oct 11 2017
%t A269542 NestWhileList[DivisorSigma[1,#]-#&,702,#>0&] (* _Paolo Xausa_, Oct 16 2023 *)
%o A269542 (PARI) lista() = {print1(a=702, ", "); until (!a, a = sigma(a) - a; print1(a, ", "););} \\ _Michel Marcus_, Feb 29 2016
%Y A269542 Cf. A001065, A008888.
%K A269542 nonn,fini,full
%O A269542 0,1
%A A269542 _Daniel Mondot_, Feb 29 2016