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 A286222 #10 Feb 16 2025 08:33:44
%S A286222 1,0,1,1,0,2,0,2,2,1,3,2,3,4,3,5,4,5,7,6,10,8,10,12,10,15,14,16,20,18,
%T A286222 25,25,28,32,31,38,38,44,49,51,59,61,68,75,79,89,93,103,113,120,137,
%U A286222 141,157,168,176,200,205,229,245,260,289,303,332,356,376,411,433,470,507,535,587
%N A286222 Number of partitions of n into distinct parts with an odd number of prime divisors (counted with multiplicity).
%H A286222 Amiram Eldar, <a href="/A286222/b286222.txt">Table of n, a(n) for n = 0..10000</a>
%H A286222 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrimeFactor.html">Prime Factor</a>
%H A286222 <a href="/index/Par#part">Index entries for related partition-counting sequences</a>
%F A286222 G.f.: Product_{k>=1} (1 + x^A026424(k)).
%e A286222 a(10) = 3 because we have [8, 2], [7, 3] and [5, 3, 2].
%t A286222 nmax = 70; CoefficientList[Series[Product[1 + Boole[OddQ[PrimeOmega[k]]] x^k, {k, 1, nmax}], {x, 0, nmax}], x]
%Y A286222 Cf. A026424, A286218, A286220, A286223.
%K A286222 nonn
%O A286222 0,6
%A A286222 _Ilya Gutkovskiy_, May 04 2017