A245077 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A245077

Largest k such that the smallest prime satisfying Goldbach's conjecture is less than or equal to (2n)^(1/k).

2, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 3, 3, 2, 1, 3, 2, 3, 3, 2, 3, 2, 2, 3, 2, 2, 3, 3, 2, 2, 3, 2, 3, 3, 2, 2, 4, 2, 4, 2, 2, 4, 2, 2, 1, 4, 2, 4, 4, 2, 4, 4, 2, 4, 2, 2, 1, 2, 1, 1, 4

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,1

COMMENTS

The 1's appear as in A244408.

LINKS

Jens Kruse Andersen, Table of n, a(n) for n = 2..10000

EXAMPLE

For n=5 we have 3+7=10. As rt3(10)<3<sqrt(10), a(5)=2.

PROG

(PARI) for (n=2, 100, p=2; while(!isprime(2*n-p), p=nextprime(p+1)); k=1; while(p<=(2*n)^(1/k), k++); print1(k-1", ")) \\ Jens Kruse Andersen, Jul 12 2014

CROSSREFS

Cf. A244408.

Cf. A020481, A002373, A025018, A025019.

Sequence in context: A192006 A006928 A087890 * A008676 A025893 A296977

Adjacent sequences: A245074 A245075 A245076 * A245078 A245079 A245080

KEYWORD

nonn

AUTHOR

Jon Perry, Jul 11 2014

EXTENSIONS

Definition corrected by Jens Kruse Andersen, Jul 12 2014

STATUS

approved