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 A234716 #8 Jan 30 2018 21:47:54
%S A234716 0,0,0,0,0,1,1,1,2,1,1,2,2,3,4,3,3,4,5,5,6,5,5,6,6,6,7,6,7,8,8,8,9,9,
%T A234716 9,9,9,9,10,10,10,11,11,12,13,12,13,14,15,14,15,14,14,15,15,14,15,14,
%U A234716 15,16,17,18,19,19,19,19,19,20,21,20,20,21,22,23
%N A234716 Number of odd composite integers k, such that n-1 < k < 2n-2.
%C A234716 Number of partitions of 2n into two odd parts such that the largest part is an odd composite less than 2n-2.
%H A234716 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A234716 a(n) = floor((n-1)/2) - pi(2n-3) - pi(n-1).
%e A234716 a(9) = 2; There are two partitions of 2(9) = 18 into two odd parts such that the largest part is an odd composite less than 2(9)-2 = 16: (15,3) and (9,9).
%p A234716 with(numtheory); A234716:=n->floor((n-1)/2) - pi(2*n-3) + pi(n-1); seq(A234716(n), n=1..100);
%t A234716 Table[Floor[(n - 1)/2] - PrimePi[2 n - 3] + PrimePi[n - 1], {n, 100}]
%Y A234716 Cf. A002375, A141100.
%K A234716 nonn,easy
%O A234716 1,9
%A A234716 _Wesley Ivan Hurt_, Dec 29 2013