Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Aug 25 2014 12:19:04
%S 4,6,9,8,12,18,10,15,22,32,14,25,16,28,42,20,33,48,21,38,54,24,44,63,
%T 26,49,70,27,51,76,30,56,84,34,65,36,68,35,69,104,39,75,114,40,78,118,
%U 45,86,128,46,90,135,50,98,145,52,105,154,55,106,158,57,111,166,58,115
%N a(1) = 1; a(n+1) is the least composite number m not already used such that |m-a(n)| is not equal to |a(k+1)-a(k)| for any k < n.
%Y Cf. A081145, A084331, A084334.
%K nonn,easy
%O 1,1
%A _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Jun 18 2003
%E Edited and extended by _David Wasserman_, Dec 15 2004