%I A094173
%S A094173 1,2,1,3,2,4,5,3,6,7,4,3,5,8,9
%N A094173 a(n) = m if m has already occurred at least once and n=k+i*(m+1) where 
               k is the index of the first occurrence of n and i=1,...,max(n-1,1), 
               otherwise a(n) = least positive integer that has not yet occurred.
%C A094173 Is the sequence possible for all n?
%C A094173 a(16) does not exist: it would have to be be 4 (since a(6)=a(11)=4 and 
               so a(6+2*(4+1))=a(16)=4) and also 6 (since a(9)=6 and so a(9+1*(6+1))=a(16)=6) 
               simultaneously. - Herman Jamke (hermanjamke(AT)fastmail.fm), May 
               01 2008
%Y A094173 Cf. A095162, A095163, A095164.
%Y A094173 Sequence in context: A116928 A034391 A144241 this_sequence A026272 A022447 
               A117194
%Y A094173 Adjacent sequences: A094170 A094171 A094172 this_sequence A094174 A094175 
               A094176
%K A094173 nonn,fini,full
%O A094173 1,2
%A A094173 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 01 2004
%E A094173 Edited by Herman Jamke (hermanjamke(AT)fastmail.fm), May 01 2008