OFFSET
2,6
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 2..10000
EXAMPLE
n=2: prime(2)+2*prime(2+1)=3+2*5=13 is prime, so a(2)=1;
n=3: prime(3)+2*prime(3+1)=5+2*7=19 is prime, so a(2)=1;
...
n=7: prime(7)+2*prime(7+1)=17+2*19=55 is not prime
...
prime(7)+2*prime(7+4)=17+2*31=79 is prime, so a(7)=4;
MATHEMATICA
Table[p1 = Prime[n1]; n2 = 1; p2 = Prime[n1 + n2]; While[cp = p1 + 2* p2; ! PrimeQ[cp], n2++; p2 = Prime[n1 + n2]]; n2, {n1, 2, 201}]
PROG
(Haskell)
a114263 n = head [m | m <- [1..n],
a010051 (a000040 n + 2 * a000040 (n + m)) == 1]
-- Reinhard Zumkeller, Oct 31 2013
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Lei Zhou, Nov 20 2005
EXTENSIONS
Edited definition to conform to OEIS style. - Reinhard Zumkeller, Oct 31 2013
STATUS
approved