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 A343458 #23 May 07 2021 01:15:15
%S A343458 1,2,4,12,24,48,240,480,1440,2880,5760,40320,120960,241920,483840,
%T A343458 2419200,4838400,14515200,29030400,319334400,638668800,1916006400,
%U A343458 3832012800,7664025600,38320128000,498161664000,996323328000,6974263296000,20922789888000,41845579776000,83691159552000
%N A343458 Distinct values of the least common multiple of initial segments of numbers of least prime signature (A025487).
%C A343458 The least common multiple of all numbers of least prime signature (A025487) <= c equals the least common multiple of all primorial powers (A100778) <= c, where c is an arbitrary positive real number.
%C A343458 The terms of this sequence are themselves numbers of least prime signature. Write a(n) in its prime factorization, Product_{i=1..k} A000040(i)^e_i. Then e_i is approximately proportional to 1/log_2(A002110(i)).
%C A343458 More precisely, the least common multiple of all numbers of least prime signature (A025487) <= c has prime factorization Product_{i>=1} A000040(i)^e_i, where e_i = floor(log(c)/log(A002110(i))).
%H A343458 David A. Corneth, <a href="/A343458/b343458.txt">Table of n, a(n) for n = 1..1317</a>
%F A343458 a(1) = 1, a(n) = lcm(a(n-1), A100778(n)) for n >= 2. - _David A. Corneth_, Apr 18 2021
%e A343458 The least common multiple of the numbers of least prime signature up through 36 is equal to the least common multiple of all primorial powers up through 36, including 2^5 = 32, 6^2 = 36, and 30^1 = 30. Thus 2^5 * 3^2 * 5 = 1440 is a term of this sequence.
%Y A343458 Cf. A025487, A100778.
%K A343458 nonn
%O A343458 1,2
%A A343458 _Hal M. Switkay_, Apr 15 2021
%E A343458 More terms from _David A. Corneth_, Apr 18 2021