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 A352298 #8 Mar 13 2022 19:14:16 %S A352298 -1,-1,68,128,152,188,332,398,368,488,632,692,626,992,878,908,1112, %T A352298 998,1412,1202,1448,1718,1532,1604,1682,2048,2252,2078,2672,2642,2456, %U A352298 2936,2504,2588,2978,3092,3032,3218,3272,3296,3632,3548,3754,4022,4058,4412,4448 %N A352298 Conjectured largest number that can be expressed as the sum of two primes in exactly n ways or -1 if no such number exists. %C A352298 Conjecture A in page 32 of the Hardy and Littlewood reference implies that a(n) != -1 for all n > 1. While the sequence is not monotonic, the plot of n versus a(n)/log(a(n))^2 has a linear trend which matches with the formula for the number of representations in Conjecture A. %H A352298 G. H. Hardy and J. E. Littlewood, <a href="https://doi.org/10.1007/BF02403921">Some problems of 'Partitio numerorum'; III: On the expression of a number as a sum of primes</a>, Acta Mathematica, volume 44, pages 1-70 (1923). %Y A352298 Cf. A352296. %Y A352298 Essentially the same as A000954. %K A352298 sign %O A352298 0,3 %A A352298 _Chai Wah Wu_, Mar 11 2022