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 A293548 #5 Oct 11 2017 18:10:00
%S A293548 1,0,1,1,2,2,5,4,8,9,15,16,28,29,46,54,77,90,131,150,211,251,337,401,
%T A293548 540,637,839,1006,1296,1551,1995,2373,3013,3610,4523,5410,6754,8045,
%U A293548 9965,11897,14614,17410,21313,25316,30816,36615,44307,52539,63387,74975,90078
%N A293548 Expansion of Product_{k>=2} 1/(1 - x^k)^omega(k), where omega(k) is the number of distinct primes dividing k (A001221).
%C A293548 Euler transform of A001221.
%H A293548 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%F A293548 G.f.: Product_{k>=2} 1/(1 - x^k)^b(k), where b(k) = [x^k] Sum_{j>=1} x^prime(j)/(1 - x^prime(j)).
%F A293548 a(0) = 1; a(n) = (1/n)*Sum_{k=1..n} a(n-k)*b(k), b(k) = Sum_{d|k} d*omega(d).
%t A293548 nmax = 50; CoefficientList[Series[Product[1/(1 - x^k)^PrimeNu[k], {k, 2, nmax}], {x, 0, nmax}], x]
%t A293548 a[n_] := a[n] = If[n == 0, 1, Sum[Sum[d PrimeNu[d], {d, Divisors[k]}] a[n - k], {k, 1, n}]/n]; Table[a[n], {n, 0, 50}]
%Y A293548 Cf. A001221, A006171, A293549.
%K A293548 nonn
%O A293548 0,5
%A A293548 _Ilya Gutkovskiy_, Oct 11 2017