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 A141095 #10 Jun 30 2023 15:03:30
%S A141095 1,0,0,0,1,0,0,1,0,0,1,0,1,1,0,0,2,1,0,1,0,1,2,0,1,2,0,1,3,0,1,4,1,1,
%T A141095 1,0,3,4,1,0,4,0,4,3,0,4,5,1,1,3,1,4,6,0,0,4,1,6,6,1,5,7,1,5,3,0,8,7,
%U A141095 0,0,10,3,9,9,0,6,5,2,8,5,2,9,10,1,5,11,2,9,12,0,3,12,4,11,5,2,12,9,1,4,14
%N A141095 Number of unordered pairs of coprime nonprime numbers that sum to 2n.
%C A141095 Nonprime numbers are 1 and the composite numbers. See A141097 for pairs of coprime composite numbers. It appears that a(n) > 0 except for the 26 values of 2n given in A141096.
%H A141095 T. D. Noe, <a href="/A141095/b141095.txt">Table of n, a(n) for n=1..10000</a>
%H A141095 Carlos Rivera, <a href="http://www.primepuzzles.net/conjectures/conj_033.htm">Conjecture 33: The Goldbach Temptation</a>, The Prime Puzzles & Problems Connection.
%e A141095 a(17)=2 because 34 = 1+33 = 9+25.
%t A141095 Table[cnt=0; Do[If[GCD[2n-i,i]==1 && !PrimeQ[i] && !PrimeQ[2n-i], cnt++ ], {i,1,n,2}]; cnt, {n,100}]
%Y A141095 Cf. A141099, A141100.
%K A141095 nonn,look
%O A141095 1,17
%A A141095 _T. D. Noe_, Jun 02 2008