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 A329004 #64 Jun 11 2020 16:51:50
%S A329004 1,2,3,4,4,6,6,8,8,10,10,12,12,12,12,12,12,18,18,20,20,20,20,24,24,24,
%T A329004 24,24,24,30,30,30,30,30,30,36,36,36,36,36,36,36,36,36,36,36,36,48,48,
%U A329004 48,48,48,48,48,48,48,48,48,48,60,60,60,60,60,60,60,60,60,60,60,60,72
%N A329004 a(n) is the largest index in [n] that maximizes tau.
%H A329004 Peter Andrew, <a href="/A329004/b329004.txt">Table of n, a(n) for n = 1..20000</a>
%F A329004 a(n) = n <=> n in { A067128 }. - _Alois P. Heinz_, Jun 11 2020
%p A329004 a:= proc(n) option remember; uses numtheory; `if`(n=1, 1,
%p A329004 (t-> `if`(tau(n)<tau(t), t, n))(a(n-1)))
%p A329004 end:
%p A329004 seq(a(n), n=1..100); # _Alois P. Heinz_, Jun 11 2020
%t A329004 dmax = 0; nmax = 1; seq = {}; Do[If[(d = DivisorSigma[0, n]) >= dmax, dmax = d; nmax = n]; AppendTo[seq, nmax], {n, 1, 72}]; seq (* _Amiram Eldar_, Jun 11 2020 *)
%o A329004 (Haskell) a329004 = map fst $ scanl1 (\x y -> maximumBy (comparing snd) [x,y]) $ zip [1..] a000005
%Y A329004 Cf. A000005, A067128.
%K A329004 nonn
%O A329004 1,2
%A A329004 _Peter Andrew_, Jun 10 2020