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 A326514 #6 Jul 12 2019 20:19:48
%S A326514 1,1,1,1,1,1,1,2,1,1,1,3,1,1,1,2,1,3,1,3,1,1,1,3,1,1,2,3,1,4,1,3,1,1,
%T A326514 1,3,1,1,1,3,1,4,1,3,3,1,1,5,1,3,1,3,1,3,1,3,1,1,1,4,1,1,3,4,1,4,1,3,
%U A326514 1,4,1,6,1,1,3,3,1,4,1,5,2,1,1,4,1,1,1
%N A326514 Number of factorizations of n into factors > 1 where each factor has a different number of prime factors counted with multiplicity.
%H A326514 Gus Wiseman, <a href="/A038041/a038041.txt">Sequences counting and ranking multiset partitions whose part lengths, sums, or averages are constant or strict.</a>
%e A326514 The a(96) = 8 factorizations: (2*4*12), (2*6*8), (2*48), (3*4*8), (3*32), (4*24), (6*16), (96).
%t A326514 facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
%t A326514 Table[Length[Select[facs[n],UnsameQ@@PrimeOmega/@#&]],{n,100}]
%Y A326514 Cf. A001055, A007837, A038041, A321455, A321469, A322794, A326026, A326515, A326516, A326517, A326533.
%K A326514 nonn
%O A326514 1,8
%A A326514 _Gus Wiseman_, Jul 11 2019