login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A025018
Numbers k such that least prime in the Goldbach partition of k increases.
13
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
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
Sequence in context: A351523 A263656 A178674 * A102043 A025017 A133427
KEYWORD
nonn,nice
EXTENSIONS
Edited and extended by Robert G. Wilson v, Dec 13 2002
STATUS
approved