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 A050332 #12 May 26 2017 04:28:38
%S A050332 1,1,1,0,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,0,1,1,1,1,2,1,1,1,1,
%T A050332 1,2,1,1,1,2,1,2,1,1,1,1,1,2,0,1,1,1,1,2,1,2,1,1,1,3,1,1,1,1,1,2,1,1,
%U A050332 1,2,1,2,1,1,1,1,1,2,1,2,1,1,1,3,1,1,1,2,1,3,1,1,1,1,1,3,1,1,1,2,1,2,1
%N A050332 Number of factorizations of n into distinct numbers with an odd number of prime factors.
%C A050332 a(n) depends only on prime signature of n (cf. A025487). So a(24) = a(375) since 24 = 2^3*3 and 375 = 3*5^3 both have prime signature (3,1).
%H A050332 R. J. Mathar, <a href="/A050332/b050332.txt">Table of n, a(n) for n = 1..2519</a>
%F A050332 Dirichlet g.f.: Product_{n is in A026424}(1+1/n^s).
%F A050332 a(n) = A050333(A101296(n)). - _R. J. Mathar_, May 26 2017
%Y A050332 Cf. A026424, A045778, A050333. a(p^k)=A000700. a(A002110)=A003724.
%K A050332 nonn
%O A050332 1,24
%A A050332 _Christian G. Bower_, Oct 15 1999