A260485 Smallest number m such that 2*m = OddPrime(n) + q, q prime, and 2*m - prime(k) is not prime for k less than n.

3, 4, 6, 8, 10, 14, 16, 20, 24, 22, 28, 32, 40, 38, 48, 51, 46, 55, 62, 58, 75, 68, 74, 82, 87, 91, 98, 94, 110, 112, 116, 123, 121, 128, 130, 142, 136, 152, 155, 146, 166, 182, 175, 188, 190, 184, 207, 200, 214, 206, 218, 232, 221, 243, 252, 255, 247, 238

Offset

1,1

Comments

a(n) = A260580(n,1);

smallest number m such that the n-th odd prime p is needed to write 2*m = (p+q)/2.

Links

Reinhard Zumkeller, Table of n, a(n) for n = 1..1000

Prog

(Haskell)
a260485 = head . a260580_row

Crossrefs

Cf. A260580, A208662, A065091.

Sequence in context: A301752 A173339 A064269 * A373846 A120150 A262892

Adjacent sequences: A260482 A260483 A260484 * A260486 A260487 A260488

Keyword

nonn

Author

Reinhard Zumkeller, Aug 11 2015

Status

approved