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 A050330 #12 May 26 2017 04:27:48
%S A050330 1,1,1,1,1,1,1,2,1,1,1,2,1,1,1,2,1,2,1,2,1,1,1,3,1,1,2,2,1,2,1,3,1,1,
%T A050330 1,3,1,1,1,3,1,2,1,2,2,1,1,4,1,2,1,2,1,3,1,3,1,1,1,4,1,1,2,4,1,2,1,2,
%U A050330 1,2,1,5,1,1,2,2,1,2,1,4,2,1,1,4,1,1,1,3,1,4,1,2,1,1,1,6,1,2,2,3,1,2,1
%N A050330 Number of factorizations of n into numbers with an odd number of prime factors.
%C A050330 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 A050330 R. J. Mathar, <a href="/A050330/b050330.txt">Table of n, a(n) for n = 1..2519</a>
%F A050330 Dirichlet g.f.: Product_{n in A026424} (1/(1-1/n^s)).
%F A050330 a(n) = A050331(A101296(n)). - _R. J. Mathar_, May 26 2017
%Y A050330 Cf. A001055, A026424, A050331. a(p^k)=A000009. a(A002110)=A003724.
%K A050330 nonn
%O A050330 1,8
%A A050330 _Christian G. Bower_, Oct 15 1999