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 A338160 #18 Oct 14 2020 23:22:51
%S A338160 1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,2,1,2,1,1,1,1,1,1,1,2,1,1,1,2,1,1,
%T A338160 1,1,1,1,1,1,1,1,1,2,2,1,1,2,1,2,1,2,1,1,1,1,1,1,1,3,1,1,2,1,1,1,1,2,
%U A338160 1,1,1,3,1,1,2,2,1,1,1,2,1,1,1,3,1,1,1,1,1,3,1,2,1,1,1,4
%N A338160 Number of ways to represent n as a product of the greatest number of distinct factors.
%C A338160 a(n) = A058060(n) for 1 < n < 60; a(60) = 3, A058060(60) = 1.
%C A338160 a(n) is the number of factorizations of n into A086435(n) distinct factors > 1.
%C A338160 a(n) depends only on the prime signature of n.
%e A338160 a(72) = 3 because 72 = 2*3*12 = 2*4*9 = 3*4*6 and 72 cannot be represented as a product of 4 distinct factors each greater than 1 (adding the factor 1 to each product doesn't change anything).
%o A338160 (PARI) a(n)={my(d=divisors(n)); my(F(r,k)=if(r==1, [0,1], my(b=-1,c=0); for(k=2, k, if(r%d[k]==0, my([tb,tc]=self()(r/d[k], k-1)); if(tb>b, b=tb; c=0); if(tb==b, c+=tc))); [b+1, c])); F(n, #d)[2]} \\ _Andrew Howroyd_, Oct 14 2020
%Y A338160 Cf. A086435, A140207, A338159.
%K A338160 nonn
%O A338160 1,12
%A A338160 _Vladimir Letsko_, Oct 14 2020
%E A338160 More terms from _Andrew Howroyd_, Oct 14 2020