A135733 For every integer m > a(n), 2m can be decomposed into at least n unordered sums of two primes (conjectural).

1, 6, 34, 64, 76, 94, 166, 199, 244, 244, 316, 346, 496, 496, 556, 556, 556, 706, 706, 724, 724, 859, 1024, 1024, 1024, 1024, 1126, 1336, 1336, 1468, 1468, 1468, 1489, 1489, 1489, 1546, 1609, 1609, 1636, 1648, 1816, 1877, 1877, 2011, 2029, 2206, 2224

Offset

1,2

Comments

Goldbach's conjecture is equivalent to the case when n = 1, but for large n there appears to be many decompositions guaranteed. This sequence relies on a heuristic calculation and there is no proof that it is correct.

Links

H. J. Smith, Table of n, a(n) for n = 1..5000

H. J. Smith, Goldbach's Conjecture

Crossrefs

Cf. A045917.

Sequence in context: A044464 A113528 A152528 * A072312 A233510 A296808

Adjacent sequences: A135730 A135731 A135732 * A135734 A135735 A135736

Keyword

nonn

Author

Harry J. Smith, Nov 26 2007

Status

approved