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.
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.
Terms
- a(0) =1a(1) =13a(2) =121a(3) =1003a(4) =7627a(5) =59791a(6) =258907a(7) =1859305
External references
- oeis: A091111