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 A184198 #14 Jan 11 2021 10:08:37
%S A184198 1,0,0,0,1,1,1,1,2,2,3,2,4,4,6,5,8,7,11,10,15,13,20,17,26,23,34,29,43,
%T A184198 38,55,49,69,62,88,78,109,97,135,122,167,150,205,186,251,227,306,277,
%U A184198 371,337,448,407,539,492,647,591,773,707,922,845,1096,1005,1298,1193,1535,1412,1809,1667,2127
%N A184198 Number of partitions of n into an even number of primes.
%H A184198 Vaclav Kotesovec, <a href="/A184198/b184198.txt">Table of n, a(n) for n = 0..10000</a>
%F A184198 a(n) = (A000607(n)+A048165(n))/2.
%e A184198 n=18 can be partitioned in A000607(18)=19 ways into primes, of which a(18)=11 are even, namely 11+7, 13+5, 5+5+5+3, 7+5+3+3, 3+3+3+3+3+3, 7+7+2+2, 11+3+2+2, 5+3+3+3+2+2, 5+5+2+2+2+2, 7+3+2+2+2+2, 3+3+2+2+2+2+2+2.
%e A184198 The remaining A184199(18)=8 are odd.
%t A184198 Table[Count[IntegerPartitions[n],_?(AllTrue[#,PrimeQ]&&EvenQ[Length[ #]]&)], {n,0,70}] (* The program uses the AllTrue function from Mathematica version 10 *) (* _Harvey P. Dale_, Feb 16 2018 *)
%o A184198 (PARI)
%o A184198 parts(n, pred, y)={prod(k=1, n, if(pred(k), 1/(1-y*x^k) + O(x*x^n), 1))}
%o A184198 {my(n=80); Vec(parts(n, isprime, 1) + parts(n, isprime, -1))/2} \\ _Andrew Howroyd_, Dec 28 2017
%Y A184198 Cf. A000607, A048165, A184199, A184171.
%K A184198 nonn,easy
%O A184198 0,9
%A A184198 _R. J. Mathar_, Jan 10 2011
%E A184198 a(31)-a(69) corrected by _Andrew Howroyd_, Dec 28 2017