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 A036451 #16 Nov 02 2020 18:52:36
%S A036451 1,2,3,4,6,8,12,16,20,24,32,40,48,64,80,96,120,144,168,200,240,288,
%T A036451 360,432,504,600,720,864,1008,1152,1344,1600,1920,2304,2688,3072,3584,
%U A036451 4096,4800,5760,6720,7680,8640,10080,11520,13824,16128,18432,20736,23040
%N A036451 Maximal value of d(x) (the number of divisors of x, A000005) if the binary order (see A029837) of x, the value g(x) = n.
%C A036451 g(x) <= n can be replaced by g(x) = n.
%H A036451 Giovanni Resta, <a href="/A036451/b036451.txt">Table of n, a(n) for n = 0..250</a> (based on A002182 b-file)
%e A036451 In the range of g(x) <= 5, the values of d(x) can be: 1, 2, 3, 4, 5, 6, 8 of which 8 is the maximal, so a(n) = a(g(x)) = 8.
%t A036451 Max /@ Table[DivisorSigma[0, Floor[2^(n - 1) + k]], {n, 0, 22}, {k, Ceiling[2^(n - 1)]}] (* _Michael De Vlieger_, May 10 2017 *)
%Y A036451 Cf. A000005, A002182, A029837, A005179, A007416, A036470-A036472.
%K A036451 nonn
%O A036451 0,2
%A A036451 _Labos Elemer_
%E A036451 a(22)-a(32) from _Alex Ratushnyak_, Jun 06 2013
%E A036451 a(33)-a(49) from _Giovanni Resta_, Jun 06 2013