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 A226983 #28 Jan 30 2018 21:47:41
%S A226983 0,-1,0,0,1,1,1,2,2,1,2,2,3,4,4,3,4,5,5,6,6,5,6,6,7,7,7,7,8,8,8,9,10,
%T A226983 9,10,9,9,10,11,10,11,11,12,13,13,13,14,15,15,15,15,14,15,15,15,15,15,
%U A226983 15,16,17,18,19,20,19,20,19,20,21,21,20,21,22,23,24
%N A226983 a(n) = ceiling(n/2) - pi(2n) + pi(n-1).
%C A226983 The number of partitions of 2n into exactly two parts such that the first part is an odd composite integer, n > 2.
%H A226983 Muniru A Asiru, <a href="/A226983/b226983.txt">Table of n, a(n) for n = 1..1000</a>
%H A226983 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A226983 a(n) = floor((n+1)/2) - ( pi(2n) - pi(n-1) ) = A004526(n+1) - A035250(n).
%p A226983 with(numtheory); seq(ceil(k/2)-(pi(2*k)-pi(k-1)),k=1..100);
%t A226983 Table[Floor[(n + 1) / 2] - (PrimePi[2 n] - PrimePi[n - 1]), {n, 100}] (* _Vincenzo Librandi_, Dec 07 2016 *)
%o A226983 (PARI) a226983(n) = if(n==1, 0, ceil(n/2) - primepi(2*n) + primepi(n-1)) \\ _Michael B. Porter_, Jun 29 2013
%Y A226983 Cf. A000720, A004526, A035250.
%K A226983 sign,easy
%O A226983 1,8
%A A226983 _Wesley Ivan Hurt_, Jun 25 2013