A083311 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).

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, 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, 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

Offset

1,12

Comments

a(n) = LD-10(n, A083310(n)), where LD-10 is the Levenshtein distance on decimal strings.

Links

Table of n, a(n) for n=1..105.

Michael Gilleland, Levenshtein Distance. [It has been suggested that this algorithm gives incorrect results sometimes. - N. J. A. Sloane]

Crossrefs

Sequence in context: A103663 A349925 A339171 * A104230 A226774 A037968

Adjacent sequences: A083308 A083309 A083310 * A083312 A083313 A083314

Keyword

nonn,base

Author

Reinhard Zumkeller, Apr 24 2003

Status

approved