|
%I #6 Mar 30 2012 18:50:43
%S 1,13,121,1003,7627,59791,258907,1859305
%N 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.
%C A091110(a(n))=n and A091110(m)>n for m>a(n).
%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_]
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Binary.html">Binary</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Ternary.html">Ternary</a>
%K nonn
%O 0,2
%A _Reinhard Zumkeller_, Dec 20 2003
| 