1,2

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.

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

H. J. Smith, Goldbach's Conjecture

Cf. A045917.

Sequence in context: A044464 A113528 A152528 * A072312 A233510 A067389

Adjacent sequences: A135730 A135731 A135732 * A135734 A135735 A135736

nonn

Harry J. Smith, Nov 26 2007

approved