1,2

a(A091111(n))=n and a(m)>n for m>A091111(n).

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

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

Eric Weisstein's World of Mathematics, Binary

Eric Weisstein's World of Mathematics, Ternary

a(n) = LevenshteinDistance(A007088(n), A007088(n)).

Sequence in context: A226942 A030371 A029550 * A339660 A104659 A077197

Adjacent sequences: A091107 A091108 A091109 * A091111 A091112 A091113

nonn

Reinhard Zumkeller, Dec 20 2003

approved