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 A285798 #11 Dec 10 2020 14:51:27
%S A285798 1,1,1,1,1,1,2,2,2,2,3,3,5,5,6,7,8,8,11,11,14,16,19,19,25,26,31,34,40,
%T A285798 41,51,53,62,68,80,85,103,107,124,135,157,166,195,205,235,256,294,311,
%U A285798 362,383,437,472,535,568,652,695,786,847,954,1016,1155,1231,1381,1486,1662,1774,1997,2130,2377,2557,2846
%N A285798 Number of partitions of n into parts with an even number of distinct prime divisors.
%H A285798 Alois P. Heinz, <a href="/A285798/b285798.txt">Table of n, a(n) for n = 0..10000</a>
%H A285798 <a href="/index/Par#part">Index entries for related partition-counting sequences</a>
%F A285798 G.f.: Product_{k>=1} 1/(1 - x^A030231(k)).
%e A285798 a(10) = 3 because we have [10], [6, 1, 1, 1, 1] and [1, 1, 1, 1, 1, 1, 1, 1, 1, 1].
%t A285798 nmax = 70; CoefficientList[Series[Product[1/(1 - Boole[EvenQ[PrimeNu[k]]] x^k), {k, 1, nmax}], {x, 0, nmax}], x]
%Y A285798 Cf. A030231, A087153 (number of partitions into parts with an even number of divisors), A285799.
%K A285798 nonn
%O A285798 0,7
%A A285798 _Ilya Gutkovskiy_, Apr 26 2017