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
KEYWORD
nonn
AUTHOR
Harry J. Smith, Nov 26 2007
STATUS
approved