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 A100949 #22 May 09 2019 05:04:31
%S A100949 0,0,0,0,0,1,1,1,2,0,3,2,2,1,2,2,5,1,2,2,3,2,4,2,3,3,5,5,4,1,2,4,5,2,
%T A100949 4,3,5,6,4,5,6,3,4,5,6,5,4,3,4,4,8,7,6,4,3,7,8,6,4,4,3,10,7,6,7,4,6,
%U A100949 10,7,6,5,6,4,7,8,9,7,5,6,9,8,9,4,5,7,8,9,11,8,4,4,11,12,10,6,10,7,13,9,9,6
%N A100949 Number of partitions of n into a prime and a semiprime.
%C A100949 Marnell conjectures that a(n) > 0 for n > 10 after analyzing "many thousands of whole numbers". I find no exceptions below 100 million. - _Charles R Greathouse IV_, May 04 2010
%D A100949 Geoffrey R. Marnell, "Ten Prime Conjectures", Journal of Recreational Mathematics 33:3 (2004-2005), pp. 193-196.
%H A100949 T. D. Noe, <a href="/A100949/b100949.txt">Table of n, a(n) for n = 1..10000</a>
%F A100949 A100951(n) <= A100950(n) <= a(n) <= min(A000720(n), A072000(n)).
%F A100949 a(n) = Sum_{i=1..floor(n/2)} A010051(i) * A064911(n-i) + A010051(n-i) * A064911(i). - _Wesley Ivan Hurt_, May 02 2019
%e A100949 a(21) = #{7+2*7, 11+2*5, 17+2*2} = 3.
%t A100949 Table[Count[Sort/@(PrimeOmega/@IntegerPartitions[n,{2}]),{1,2}],{n,110}] (* _Harvey P. Dale_, Mar 25 2018 *)
%o A100949 (PARI) list(lim)=my(p=primes(primepi(lim)),sp=select(n->bigomega(n)==2, vector(lim\1,i,i)),x=O('x^(lim\1+1))+'x); concat([0,0,0,0,0], Vec(sum(i=1,#p,x^p[i])*sum(i=1,#sp,x^sp[i]))) \\ _Charles R Greathouse IV_, Jun 14 2013
%o A100949 (Haskell)
%o A100949 a100949 n = sum $ map (a010051 . (n -)) $ takeWhile (< n) a001358_list
%o A100949 -- _Reinhard Zumkeller_, Jun 26 2013
%Y A100949 Cf. A061358, A000040, A001358.
%Y A100949 Cf. A010051.
%K A100949 nonn,easy
%O A100949 1,9
%A A100949 _Reinhard Zumkeller_, Nov 23 2004