> z=200;v=vector(z);v[1]=1;n=2;print(n);

> while(1,f=0;for(i=2,z,m=i*2;

> if(v[i]==0 && isprime(n*m+1) &&

> isprime(n+m+1),f=m;v[i]=1;break));

> if(f==0,break);

> print(m);n=m)

Wicked. It works like a charm. I adapted your program for this sequence:

%I A073656

%S A073656 1,1,2,3,8,5,144,13,34,55

%N A073656 Rearrangement of Fibonacci numbers such

that the sum of two consecutive terms is a prime.

%Y A073656 Cf. A073655, A073657.

%K A073656 more,nonn

%O A073656 1,3

%A A073656 Amarnath Murthy

and searched through z=4000 without finding any more terms. Are there any

more?