login
a(1) = 2; a(n+1) is the least prime p not already used such that |p-a(n)| is not equal to |a(k+1)-a(k)| for any k < n.
6

%I #7 Aug 23 2014 13:04:20

%S 2,3,5,11,7,17,29,13,31,23,37,59,19,43,71,41,61,97,47,73,107,53,101,

%T 139,67,109,167,79,131,163,83,127,173,89,149,211,103,179,113,181,251,

%U 137,193,257,151,229,311,157,269,359,191,277,373,197,271,389,199,293

%N a(1) = 2; a(n+1) is the least prime p not already used such that |p-a(n)| is not equal to |a(k+1)-a(k)| for any k < n.

%e 13 (not 19) follows 29 as 29-13 = 16 has not occurred as the difference of successive terms, though 19 has also not occurred earlier but 29-19 = 10 = 17-7.

%Y Cf. A081145, A084334, A101595.

%K nonn,easy

%O 1,1

%A _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Jun 17 2003

%E Edited and extended by _David Wasserman_, Dec 14 2004