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 A205727 #26 Feb 24 2018 11:57:02
%S A205727 0,0,1,2,4,6,8,11,14,19,23,28,33,37,46,51,56,66,73,80,88,96,108,118,
%T A205727 126,134,148,159,172,183,197,207,220,234,249,263,280,297,309,323,338,
%U A205727 356,376,393,412,427,449,465,482,505,527,544,561,582,606,634,658
%N A205727 Number of odd semiprimes <= n^2.
%C A205727 The Goldbach conjecture being true would imply that for every integer j, there exists at least one integer k such that (j^2)-(k^2) is an odd semiprime; i.e., for 2j=p+q, j=(p+q)/2 and k=(p-q)/2 results in (j^2)-(k^2)=pq. [Note that in many cases, 2j can be expressed as the sum of more than one set of two primes.] See A205728 for related series where p must be distinct from q.
%t A205727 SemiPrimeQ[n_Integer] := If[Abs[n] < 2, False, (2 == Plus @@ Transpose[FactorInteger[Abs[n]]][[2]])];nn = 100; t = Select[Range[1, nn^2, 2], SemiPrimeQ]; Table[Length[Select[t, # <= n^2 &]], {n, nn}] (* _T. D. Noe_, Jan 30 2012 *)
%t A205727 With[{osp=Table[{n,PrimeOmega[n]},{n,1,10001,2}]},Table[ Count[ Select[ osp,#[[1]]<=k^2&],_?(#[[2]]==2&)],{k,60}]] (* _Harvey P. Dale_, Dec 29 2017 *)
%o A205727 (PARI) a(n) = sum(k=1, n^2, (k%2) && (bigomega(k) == 2)); \\ _Michel Marcus_, Feb 24 2018
%Y A205727 Cf. A046315, A205726, A205728.
%K A205727 nonn
%O A205727 1,4
%A A205727 _Keith Backman_, Jan 30 2012