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 A019295 #29 Sep 08 2022 08:44:44
%S A019295 1,2,5,2,24,2,24,3,168,12,1834560,10,84480,12,4,2,92520,20,62720,84,3,
%T A019295 49920,6516224,7,881280,28,3360,2,
%U A019295 517517500266693633076805172570524811961093324800,728,912,18,19767296,46260,144,42,30349648609280,38644089120,30,663,34042889727216750428160
%N A019295 a(n) = sigma(sigma(...(sigma(n))...)) / n, where sigma (A000203) is iterated until a multiple of n is reached.
%C A019295 The minimal number of iterations of the sigma function until a multiple of n is reached (after the initial n) is given in A019294.
%C A019295 See also the Cohen-te Riele links in A019276.
%H A019295 Graeme L. Cohen and Herman J. J. te Riele, <a href="http://projecteuclid.org/euclid.em/1047565640">Iterating the sum-of-divisors function</a>, Experimental Mathematics, 5 (1996), pp. 93-100.
%H A019295 <a href="https://www.emis.de/journals/EM/expmath/volumes/5/5.html">Experimental Mathematics, Volume 5 (1996)</a> ["Outdated Archival Version" as of 2005.]
%o A019295 (PARI) apply( {A019295(n,s=n)=while((s=sigma(s))%n,);s\n}, [1..50]) \\ _M. F. Hasler_, Jan 08 2020
%o A019295 (Magma) f:=func<n|DivisorSigma(1, n)>; a:=[]; for n in [1..41] do k:=n; while f(k) mod n ne 0 do k:=f(k); end while; Append(~a,f(k) div n); end for; a; // _Marius A. Burtea_, Jan 11 2020
%Y A019295 Cf. A019276 (megaperfect numbers: where A019294 reaches records), A019276 (record values), A019294 (number of iterations needed to reach a multiple of n).
%K A019295 nonn
%O A019295 1,2
%A A019295 _N. J. A. Sloane_
%E A019295 More terms from _Max Alekseyev_, Sep 22 2016
%E A019295 Edited by _M. F. Hasler_, Jan 08 2020