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 A335360 #16 Jun 08 2020 17:34:51 %S A335360 17,32,38,143,353 %N A335360 Numbers m such that the number of unordered Goldbach partitions of 2m is greater than the number of unordered Goldbach partitions of 4m. %C A335360 Integers m such that A002375(2*m) > A002375(4*m) . %C A335360 It is conjectured that a(5)=353 is the last term in this sequence. %H A335360 <a href="/index/Go#Goldbach">Index entries for sequences related to Goldbach conjecture</a> %e A335360 For a(1)=17, 2*17=34 has 4 Goldbach partitions and 4*17=68 has 2. %o A335360 (PARI) for(n=1, 1000, x=0; y=0; forprime(i=2, 2*n, if(i<=n && isprime(2*n-i), x=x+1; ); if(isprime(4*n-i), y=y+1; ); ); if(x>y, print1(n, ", "))) %Y A335360 Cf. A002375. %K A335360 nonn,more %O A335360 1,1 %A A335360 _Craig J. Beisel_, Jun 03 2020