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 A036493 #25 May 16 2018 10:15:14
%S A036493 1,2,4,8,12,30,60,120,240,504,840,1680,3960,7560,15120,32760,65520,
%T A036493 131040,262080,498960,997920,1965600,3603600,7207200,14414400,
%U A036493 32432400,64864800,122522400,245044800,514594080,1029188160,2095133040,4227022800,8454045600
%N A036493 Largest number having binary order n (A029837) and of which the number of divisors is maximal in that range of g(k) = n.
%C A036493 This sequence differs from A036451 only at n = 3, 5, 9, 12, and 15, which are the values of n for which there exists more than one k such that g(k) = n and d(k) has the maximum possible value.
%C A036493 a(n) is the largest term k in A067128 such that log_2(k) <= n. - _Jon E. Schoenfield_, May 13 2018
%e A036493 For n = 9, k is in {257, 512}, max(d(k)) = 24 (see A036451); this holds for four different numbers (360, 420, 480, and 504); a(9) = 504 since it is the largest.
%t A036493 {1}~Join~Table[Max@ MaximalBy[Range[2^(n - 1) + 1, 2^n], DivisorSigma[0, #] &], {n, 24}] (* _Michael De Vlieger_, Aug 01 2017 *)
%Y A036493 Cf. A000005, A029837, A005179, A007416, A036451, A036470, A036484.
%K A036493 nonn
%O A036493 0,2
%A A036493 _Labos Elemer_
%E A036493 a(22)-a(24) from _Michael De Vlieger_, Aug 01 2017
%E A036493 a(25)-a(33) from _Jon E. Schoenfield_, May 12 2018