%I #10 May 13 2013 01:48:15
%S 3,3,5,7,7,19,23,31,37,41,43,43,47,47,61,67,71,89,109,109,113,127,131,
%T 131,137,139,149,151,163,163,167,167,173,181,197
%N For each solution x>0 to 3*prime(n)+2*x = prime(n+2+x), the sequence lists prime(n) once.
%e 3 refers to 3*prime(2) +2*1 = prime(5). The next 3 refers to 3*prime(2)+2*2 = prime(6). The 5 refers to 3*prime(3) + 2*4=prime(9). The two 7 refer to 3*prime(4)+2*4=prime(10) and 3*prime(4)+2*5=prime(11).
%o (PARI) find(p)=my(t=3*p);forprime(q=nextprime(nextprime(p+1)+1)+1, default(primelimit), t+=2;if(q>=t,return(if(q>t,0,1+isprime(q+2)))));error("not enough primes")
%o forprime(p=3,200,for(i=1,find(p),print1(p", "))) \\ _Charles R Greathouse IV_, Mar 09, 2012
%K nonn
%O 1,1
%A _Roger L. Bagula_, Oct 18 2002
%E Another 43 added by R. J. Mathar, Mar 09 2012