OFFSET
3,1
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 3..10000
EXAMPLE
n=3: 2*prime(3)+3=2*5+3=13 is prime, so a(3)=3;
n=4: 2*prime(4)+5=2*7+5=19 is prime, so a(4)=5;
...
n=8: 2*prime(8)+17=2*19+17=55 is not prime
2*prime(8)+13=2*19+13=51 is not prime
...
2*prime(8)+5=2*19+5=43 is prime, so a(8)=5;
MATHEMATICA
Table[p1 = Prime[n1]; n2 = 1; p2 = Prime[n1 - n2]; While[cp = 2*p1 + p2; ! PrimeQ[cp], n2++; If[n2 >= n1, Print[n1]]; p2 = Prime[n1 - n2]]; p2, {n1, 3, 202}]
PROG
(Haskell)
a114235 n = head [p | let q = a000040 n,
p <- reverse $ takeWhile (< q) a000040_list,
a010051 (2 * q + p) == 1]
-- Reinhard Zumkeller, Oct 29 2013
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Lei Zhou, Nov 20 2005
EXTENSIONS
Edited definition to conform to OEIS style. - Reinhard Zumkeller, Oct 29 2013
STATUS
approved