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 A112021 #16 Dec 28 2017 21:30:34
%S A112021 0,1,1,1,2,2,3,3,4,5,6,7,9,10,12,14,17,19,23,26,30,35,40,46,52,60,67,
%T A112021 77,87,98,111,124,140,157,175,197,219,244,272,302,336,372,412,456,503,
%U A112021 556,613,675,742,816,896,983,1078,1180,1291,1411,1542,1683,1836,2001,2178
%N A112021 Number of partitions of n into Chen primes.
%C A112021 a(n) = A000607(n) for n <= 42.
%H A112021 Andrew Howroyd, <a href="/A112021/b112021.txt">Table of n, a(n) for n = 1..1000</a>
%F A112021 G.f.: Product_{k>=1} 1/(1 - x^A109611(k)). - _Andrew Howroyd_, Dec 28 2017
%t A112021 fQ[n_] := PrimeQ@n && (PrimeQ[n + 2] || 2 == Plus @@ Last /@ FactorInteger[n + 2]); f[n_] := Block[{c = k = 0, l = PartitionsP@n, p = Union /@ IntegerPartitions@n}, While[k++; k < l, If[Union[fQ /@ p[[k]]] == {True}, c++ ]]; c]; lst = {}; Do[ AppendTo[lst, f[n]], {n, 61}]; lst (* or *)
%t A112021 Rest@ CoefficientList[ Series[1/Times @@ (1 - x^Select[ Range@100, fQ@# &]), {x, 0, 61}], x] (* _Robert G. Wilson v_, Jun 16 2006 *)
%o A112021 (PARI)
%o A112021 ok(n)={isprime(n) && bigomega(n+2)<3}
%o A112021 {my(n=80); Vec(prod(k=1, n, if(ok(k), 1/(1-x^k) + O(x*x^n), 1))-1,-n)} \\ _Andrew Howroyd_, Dec 28 2017
%Y A112021 Cf. A112022, A101048, A109611.
%K A112021 nonn
%O A112021 1,5
%A A112021 _Reinhard Zumkeller_, Aug 26 2005