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 A286221 #9 Feb 16 2025 08:33:44
%S A286221 1,1,0,0,0,0,1,1,0,0,1,1,1,1,1,2,2,1,2,2,2,4,4,2,3,4,4,5,6,5,5,6,7,9,
%T A286221 10,10,12,11,11,15,16,15,17,18,19,23,26,25,27,30,33,37,38,39,46,50,52,
%U A286221 57,59,61,71,77,78,84,91,97,107,114,120,131,139,147,163,172,180,197
%N A286221 Number of partitions of n into distinct parts with an even number of distinct prime divisors.
%H A286221 Amiram Eldar, <a href="/A286221/b286221.txt">Table of n, a(n) for n = 0..10000</a>
%H A286221 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/DistinctPrimeFactors.html">Distinct Prime Factors</a>
%H A286221 <a href="/index/Par#part">Index entries for related partition-counting sequences</a>
%F A286221 G.f.: Product_{k>=1} (1 + x^A030231(k)).
%e A286221 a(21) = 4 because we have [21], [20, 1], [15, 6] and [14, 6, 1].
%t A286221 nmax = 75; CoefficientList[Series[Product[1 + Boole[EvenQ[PrimeNu[k]]] x^k, {k, 1, nmax}], {x, 0, nmax}], x]
%Y A286221 Cf. A030231, A285798, A286220.
%K A286221 nonn
%O A286221 0,16
%A A286221 _Ilya Gutkovskiy_, May 04 2017