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 A050368 #13 May 20 2021 09:37:25
%S A050368 1,2,3,5,5,12,7,16,12,20,11,39,13,28,30,42,17,60,19,65,42,44,23,126,
%T A050368 35,52,55,91,29,150,31,116,66,68,70,219,37,76,78,210,41,210,43,143,
%U A050368 150,92,47,378,70,170,102,169,53,290,110,294,114,116,59,570,61,124,210
%N A050368 Number of ways to factor n into distinct factors with 2 kinds of 2, 3 kinds of 3, ...
%H A050368 Andrew Howroyd, <a href="/A050368/b050368.txt">Table of n, a(n) for n = 1..1000</a>
%F A050368 Dirichlet g.f.: Product_{n>=2}((1+1/n^s)^n).
%o A050368 (PARI) seq(n)={my(v=vector(n, k, k==1)); for(k=2, n, my(m=logint(n,k), p=(1 + x + O(x*x^m))^k, w=vector(n)); for(i=0, m, w[k^i]=polcoef(p,i)); v=dirmul(v,w)); v} \\ _Andrew Howroyd_, Oct 27 2019
%Y A050368 Cf. A045778, A050367.
%K A050368 nonn
%O A050368 1,2
%A A050368 _Christian G. Bower_, Oct 15 1999