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 A063072 #21 Oct 30 2022 18:19:59
%S A063072 1,3,7,12,28,60,91,124,168,360,546,744,1170,2418,2880,4368,5952,9360,
%T A063072 19344,28800,39312,59520,79248,99944,112320,180048,203112,232128,
%U A063072 345600,471744,714240,950976,1199328,1451520,2160576,2437344,2926080
%N A063072 Sum of divisors of Ramanujan's highly composite numbers, or sigma(A002182(n)).
%H A063072 Amiram Eldar, <a href="/A063072/b063072.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..50 from Harry J. Smith)
%F A063072 a(n) = A000203(A002182(n)). - _Michel Marcus_, Jun 28 2018
%t A063072 s={}; dm=0; Do[d = DivisorSigma[0,n]; If[d > dm, dm=d; AppendTo[s, DivisorSigma[1,n]]], {n, 1, 10^5}]; s (* _Amiram Eldar_, Jun 28 2019 *)
%o A063072 (PARI) a=0; j=[]; for(n=1,200000,b=numdiv(n); if(b>a,a=b; j=concat(j, sigma(n)))); j
%o A063072 (PARI) { n=a=0; for (m=1, 10^9, b=numdiv(m); if(b>a, a=b; write("b063072.txt", n++, " ", sigma(m)); if (n==50, break)) ) } \\ _Harry J. Smith_, Aug 16 2009
%Y A063072 Cf. A000005, A004394, A002182, A002183, A002473, A000203.
%K A063072 easy,nonn
%O A063072 1,2
%A A063072 _Jason Earls_, Aug 02 2001
%E A063072 More terms from _Reiner Martin_, Dec 22 2001