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 A210469 #44 Aug 05 2023 06:25:16
%S A210469 0,0,0,0,1,1,1,2,2,2,3,3,4,5,5,5,6,7,7,8,8,8,9,9,10,11,11,12,13,13,13,
%T A210469 14,15,15,16,16,16,17,18,18,19,19,20,21,21,22,23,24,24,25,25,25,26,26,
%U A210469 26,27,27,28,29,30,31,32,33,33,34,34,35,36,36,36
%N A210469 a(n) = n - primepi(2n).
%C A210469 The number of distinct odd composite parts appearing in the partitions of 2n into two parts.
%C A210469 a(n) is the number of odd composite numbers up to 2*n-1. - _Michel Marcus_, Aug 05 2023
%H A210469 Vincenzo Librandi, <a href="/A210469/b210469.txt">Table of n, a(n) for n = 1..10000</a>
%H A210469 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A210469 a(n) = n - primepi(2n).
%e A210469 a(6) = 1 since 9 is the only odd composite number appearing in the partitions of 2*6 = 12 into two parts. For example, 12 = (1+11) = (2+10) = (3+9) = (4+8) = (5+7) = (6+6). Note that the numbers in the partitions with identical parts are counted only once.
%p A210469 with(numtheory); a:=n->n-pi(2*n); seq(a(k), k=1..70);
%t A210469 Table[n - PrimePi[2 n], {n, 70}] (* _Robert G. Wilson v_, Jan 24 2013 *)
%o A210469 (PARI) a(n) = n - primepi(2*n); \\ _Michel Marcus_, Aug 05 2023
%Y A210469 Cf. A099802.
%Y A210469 See A224710 for a closely related sequence.
%K A210469 nonn,easy
%O A210469 1,8
%A A210469 _Wesley Ivan Hurt_, Jan 24 2013