The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 0
 -1, -1, 68, 128, 152, 188, 332, 398, 368, 488, 632, 692, 626, 992, 878, 908, 1112, 998, 1412, 1202, 1448, 1718, 1532, 1604, 1682, 2048, 2252, 2078, 2672, 2642, 2456, 2936, 2504, 2588, 2978, 3092, 3032, 3218, 3272, 3296, 3632, 3548, 3754, 4022, 4058, 4412, 4448 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS 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. LINKS Table of n, a(n) for n=0..46. G. H. Hardy and J. E. Littlewood, Some problems of 'Partitio numerorum'; III: On the expression of a number as a sum of primes, Acta Mathematica, volume 44, pages 1-70 (1923). CROSSREFS Cf. A352296. Essentially the same as A000954. Sequence in context: A250765 A048889 A111379 * A364692 A044191 A044572 Adjacent sequences: A352295 A352296 A352297 * A352299 A352300 A352301 KEYWORD sign AUTHOR Chai Wah Wu, Mar 11 2022 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 30 23:34 EST 2023. Contains 367464 sequences. (Running on oeis4.)