%I A118763
%S A118763 0,1,2,3,4,5,6,7,8,9,19,10,11,12,13,14,15,16,17,18,28,20,21,22,23,24,25,
%T A118763 26,27,29,39,30,31,32,33,34,35,36,37,38,48,40,41,42,43,44,45,46,47,49,
%U A118763 59,50,51,52,53,54,55,56,57,58,68,60,61,62,63,64,65,66,67,69,79,70,71
%N A118763 a(n) = smallest number not occurring earlier having in decimal representation 
               to its predecessor Levenshtein distance = 1; a(0)=0.
%C A118763 Permutation of the natural numbers; inverse: A118764; A118765(n)=a(a(n)); 
               a(A118767(n))=A118767(n);
%C A118763 A118768(n) = a(n+1) - a(n);
%H A118763 Michael Gilleland, <a href="http://www.merriampark.com/ld.htm">Levenshtein 
               Distance</a>
%H A118763 R. Zumkeller, <a href="a118757.txt">Initial values of A118757 for n<=1200</
               a>
%H A118763 <a href="Sindx_Per.html#IntegerPermutation">Index entries for sequences 
               that are permutations of the natural numbers</a>
%Y A118763 Cf. A118757.
%Y A118763 Sequence in context: A066565 A095966 A092596 this_sequence A098488 A003100 
               A118757
%Y A118763 Adjacent sequences: A118760 A118761 A118762 this_sequence A118764 A118765 
               A118766
%K A118763 nonn,base
%O A118763 0,3
%A A118763 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 01 2006