Numerical results on the Goldbach conjecture

The number of Goldbach partitions has been computed for all even numbers 350,000 and compared to well-known theoretical estimates. The random fluctuations are slowly decreasing and less than ± 5 per cent at the upper end of the interval. The number of partitions is given explicitly for 2 ⁿ ,n=3(1)22. Further, if for a givenN the smallest prime in all partitions of 2N isa=a(2N) we have also determineda ₁(2N ₁)<a ₂(2N ₂)<... withN ₁<N ₂<... such thatn<N _k impliesa(2n)<a _k (2N _k ) up to 2n=40,000,000.