%I #7 Mar 30 2012 18:50:32
%S 1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,3,1,2,2,2,2,2,2,2,2,3,2,1,2,
%T 2,2,2,2,2,2,3,2,2,1,2,2,2,2,2,2,3,2,2,2,1,2,2,2,2,2,3,2,2,2,2,1,2,2,
%U 2,2,3,2,2,2,2,2,1,2,2,2,3,2,2,2,2,2,2,1,2,2,3,2,2,2,2,2,2,2,2,1,1,2,2,2,2
%N Minimal number of edit-steps (insert, delete, substitute) to obtain in decimal representation the least number greater n that contains all digits of n (A083310).
%C a(n) = LD-10(n, A083310(n)), where LD-10 is the Levenshtein distance on decimal strings.
%H Michael Gilleland, <a href="http://www.merriampark.com/ld.htm">Levenshtein Distance</a>. [It has been suggested that this algorithm gives incorrect results sometimes. - _N. J. A. Sloane_]
%K nonn,base
%O 1,12
%A _Reinhard Zumkeller_, Apr 24 2003