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 A056795 #16 Oct 10 2020 05:53:19
%S A056795 1,2,4,6,12,24,32,48,96,192,240,480,960,1920,2880,3840,7680,15360,
%T A056795 18432,36864,73728,147456,294912,442368,884736,1769472,3538944,
%U A056795 4128768,8257536,16515072,33030144,66060288,82575360,165150720,330301440
%N A056795 Number of divisors of k as k runs through sequence of distinct values of LCM(1,..,n).
%C A056795 Values of LCM's in A003418 and accordingly their number of divisors jump at powers of primes (A000961). Here divisor-numbers of LCM's are displayed without repetition.
%H A056795 Amiram Eldar, <a href="/A056795/b056795.txt">Table of n, a(n) for n = 1..3365</a>
%F A056795 a(n) = A000005(A051451(n)).
%e A056795 For x = 19,20,21,22 the value of A003418(x) = A051451(13) = LCM(1,..,x) = 232792560, of which the total number of divisors is 960, so a(13) = 960.
%o A056795 (PARI) f(n) = lcm(vector(n, i, i)); \\ A003418
%o A056795 lista(nn) = {my(last = 0); for (n=1, nn, my(new = f(n)); if (new != last, print1(numdiv(new), ", "); last = new););} \\ _Michel Marcus_, Oct 08 2020
%Y A056795 Cf. A000005, A003418, A051451, A000961.
%Y A056795 Partial sums of A305215.
%K A056795 nonn
%O A056795 1,2
%A A056795 _Labos Elemer_, Aug 28 2000