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 A333931 #7 Apr 11 2020 05:36:35
%S A333931 1,2,4,6,12,30,36,60,180,420,900,1260,4620,6300,13860,44100,55440,
%T A333931 69300,180180,485100,720720,900900,2882880,3063060,6306300,12252240,
%U A333931 15315300,49008960,58198140,107207100,232792560,290990700,931170240,1163962800,2036934900,4655851200
%N A333931 Recursive highly composite numbers: numbers with a record number of recursive divisors (A282446).
%C A333931 The corresponding record values are 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 48, 54, ...
%H A333931 Amiram Eldar, <a href="/A333931/b333931.txt">Table of n, a(n) for n = 1..200</a>
%t A333931 recDivNum[1] = 1; recDivNum[n_] := recDivNum[n] = Times @@ (1 + recDivNum/@ (Last /@ FactorInteger[n])); rm = 0; s = {}; Do[r = recDivNum[n]; If[r > rm, rm = r; AppendTo[s, n]], {n, 1, 10^4}]; s
%Y A333931 Subsequence of A025487.
%Y A333931 Cf. A282446.
%Y A333931 Analogous sequences: A002182 (highly composite), A002110 (unitary), A037992 (infinitary), A293185 (bi-unitary), A309141 (nonunitary), A318278 (exponential).
%K A333931 nonn
%O A333931 1,2
%A A333931 _Amiram Eldar_, Apr 10 2020