A091111 Greatest number m such that only n editing steps (deletion, insertion, or substitution) are needed to transform the binary representation of m into ternary representation of m.

1, 13, 121, 1003, 7627, 59791, 258907, 1859305

Offset

0,2

Comments

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

Links

Table of n, a(n) for n=0..7.

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

Crossrefs

Sequence in context: A297394 A014918 A081033 * A196921 A317483 A096053

Adjacent sequences: A091108 A091109 A091110 * A091112 A091113 A091114

Keyword

nonn

Author

Reinhard Zumkeller, Dec 20 2003

Status

approved