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 A321514 #8 Jan 22 2023 20:50:35
%S A321514 1,1,1,2,2,4,4,12,24,48,48,192,192,384,768,3840,3840,15360,15360,
%T A321514 61440,122880,245760,245760,1720320,3440640,6881280,20643840,82575360,
%U A321514 82575360,412876800,412876800,2890137600,5780275200,11560550400,23121100800,208089907200
%N A321514 Number of ways to choose a factorization of each integer from 2 to n into factors > 1.
%F A321514 a(n) = Product_{k = 1..n} A001055(k).
%e A321514 The a(8) = 12 ways to choose a factorization of each integer from 2 to 8:
%e A321514 (2)*(3)*(4)*(5)*(6)*(7)*(8)
%e A321514 (2)*(3)*(4)*(5)*(6)*(7)*(2*4)
%e A321514 (2)*(3)*(4)*(5)*(2*3)*(7)*(8)
%e A321514 (2)*(3)*(2*2)*(5)*(6)*(7)*(8)
%e A321514 (2)*(3)*(4)*(5)*(6)*(7)*(2*2*2)
%e A321514 (2)*(3)*(4)*(5)*(2*3)*(7)*(2*4)
%e A321514 (2)*(3)*(2*2)*(5)*(6)*(7)*(2*4)
%e A321514 (2)*(3)*(2*2)*(5)*(2*3)*(7)*(8)
%e A321514 (2)*(3)*(4)*(5)*(2*3)*(7)*(2*2*2)
%e A321514 (2)*(3)*(2*2)*(5)*(6)*(7)*(2*2*2)
%e A321514 (2)*(3)*(2*2)*(5)*(2*3)*(7)*(2*4)
%e A321514 (2)*(3)*(2*2)*(5)*(2*3)*(7)*(2*2*2)
%t A321514 facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
%t A321514 Table[Array[Length[facs[#]]&,n,1,Times],{n,30}]
%Y A321514 Dominates A321468.
%Y A321514 Cf. A001055, A050336, A066723, A076716, A157612, A281113, A300383, A317144, A317145, A321467, A321470, A321471, A321472.
%K A321514 nonn
%O A321514 1,4
%A A321514 _Gus Wiseman_, Nov 11 2018