login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A135733 For every integer m > a(n), 2m can be decomposed into at least n unordered sums of two primes (conjectural). 1
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 (list; graph; refs; listen; history; text; internal format)
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 A067389

Adjacent sequences:  A135730 A135731 A135732 * A135734 A135735 A135736

KEYWORD

nonn

AUTHOR

Harry J. Smith, Nov 26 2007

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 8 17:11 EST 2016. Contains 278946 sequences.