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 A036484 #14 Nov 05 2020 15:08:11
%S A036484 1,2,4,6,12,24,60,120,240,360,840,1680,2520,7560,15120,27720,55440,
%T A036484 110880,221760,498960,720720,1441440,3603600,7207200,14414400,
%U A036484 32432400,61261200,122522400,245044800,367567200,735134400,2095133040
%N A036484 a(n) is the minimal number of binary order n which has maximal number of divisors in this interval.
%C A036484 Compare with A007416, where terms of this sequence are present.
%e A036484 For n=9, with 256 < k <= 512, d(k) takes 17 distinct values, of which d(k)=24 is the greatest (see A036451 and A036470) and occurs first at k=360, so a(9)=360.
%t A036484 Block[{nn = 22, s}, s = TakeList[Array[DivisorSigma[0, # + 1] &, 2^nn - 1], 2^Range[0, nn - 1]]; {1}~Join~Map[2^(#1 - 1) + #2 & @@ FirstPosition[s, #] &, Map[Max, s]]] (* _Michael De Vlieger_, Nov 04 2020 *)
%Y A036484 Cf. A000005, A029837, A005179, A007416, A036470, A036492, A036493.
%K A036484 nonn,more
%O A036484 0,2
%A A036484 _Labos Elemer_
%E A036484 a(22)-a(31) from _Sean A. Irvine_, Nov 04 2020