This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A025018 Numbers n such that least prime in Goldbach partition of n increases. 12
 4, 6, 12, 30, 98, 220, 308, 556, 992, 2642, 5372, 7426, 43532, 54244, 63274, 113672, 128168, 194428, 194470, 413572, 503222, 1077422, 3526958, 3807404, 10759922, 24106882, 27789878, 37998938, 60119912, 113632822, 187852862, 335070838 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Charles R Greathouse IV, Table of n, a(n) for n = 1..69 (from Tomás Oliveira e Silva) Mark A. Herkommer, Goldbach Conjecture Research Jorg Richstein, Verifying Goldbach's Conjecture up to 4 * 10^14, Math. of Computation, Vol. 70, No. 236, pp. 1745-1749 (July 2000) Tomás Oliveira e Silva, Goldbach conjecture verification MATHEMATICA p = 1; r = {}; Do[ k = 2; While[ !PrimeQ[k] || !PrimeQ[2n - k], k++ ]; If[k > p, p = k; r = Append[r, 2n]], {n, 2, 10^8}]; r PROG (PARI) Gold(n)=forprime(p=2, min(n\2, default(primelimit)), if(isprime(n-p), return(p))) r=0; forstep(n=4, 1e6, 2, t=Gold(n); if(t>r, r=t; print1(n", "))) \\ Charles R Greathouse IV, Feb 21 2012 CROSSREFS Cf. A001172, A025019. Sequence in context: A056495 A263656 A178674 * A102043 A025017 A133427 Adjacent sequences:  A025015 A025016 A025017 * A025019 A025020 A025021 KEYWORD nonn,nice AUTHOR EXTENSIONS Edited and extended by Robert G. Wilson v, Dec 13 2002 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 04:08 EST 2019. Contains 319206 sequences. (Running on oeis4.)