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 A024942 #29 Apr 20 2019 03:01:55
%S A024942 1,0,0,1,0,0,0,1,0,0,1,1,0,0,1,0,0,0,1,1,0,1,1,1,0,0,2,0,0,1,2,1,0,2,
%T A024942 2,0,0,2,1,0,1,2,2,1,1,2,1,1,0,2,3,0,2,3,3,0,1,4,1,1,2,4,2,1,3,3,3,1,
%U A024942 3,4,3,2,2,6,3,1,4,6,4,1,6,6,3,3,5,7,3,3,6,7,6,2,7,9,3,2,7,10,2,4,11,10,4,5,12,7
%N A024942 Number of partitions of n into distinct primes of the form 4k + 3.
%C A024942 a(0) = 1 corresponds to the empty partition {}.
%H A024942 Alois P. Heinz, <a href="/A024942/b024942.txt">Table of n, a(n) for n = 0..10000</a>
%e A024942 a(26) = 2 since 26 = 3 + 23 = 7 + 19.
%e A024942 Even though 27 = (3 * 3) + 7 + 11 = (2 * 3) + (3 * 7) = (9 * 3), there is no partition of 27 into primes of the form 4k - 1 with all parts distinct. Hence a(27) = 0.
%t A024942 searchMax = 108; primes4km1 = Select[4Range[Ceiling[searchMax/4]] - 1, PrimeQ]; Table[Length[Select[IntegerPartitions[n, All, primes4km1], DuplicateFreeQ]], {n, 0, searchMax}] (* _Alonso del Arte_, Apr 16 2019 *)
%o A024942 (PARI) { my(V=select(x->x%4==3,primes(40))); my(x='x+O('x^V[#V])); Vec(prod(k=1,#V,1+x^V[k])) } \\ _Joerg Arndt_, Apr 19 2019
%Y A024942 Cf. A024941 (4k + 1).
%K A024942 nonn
%O A024942 0,27
%A A024942 _Clark Kimberling_
%E A024942 Definition clarified by _Felix Fröhlich_, Apr 17 2019
%E A024942 a(0) = 1 prepended by _Joerg Arndt_, Apr 19 2019