id:A091111 - OEIS Search Results

Search: id:A091111

Displaying 1-1 of 1 results found.

page 1

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.

+0
2

1, 13, 121, 1003, 7627, 59791, 258907, 1859305 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`A091110(a(n))=n and A091110(m)>n for m>a(n).`
	LINKS	`Michael Gilleland, Levenshtein Distance [It has been suggested that this algorithm gives incorrect results sometimes. - njas]` `Eric Weisstein's World of Mathematics, Binary` `Eric Weisstein's World of Mathematics, Ternary`
	CROSSREFS	`Sequence in context: A054962 A014918 A081033 this_sequence A096053 A033470 A016230` `Adjacent sequences: A091108 A091109 A091110 this_sequence A091112 A091113 A091114`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Dec 20 2003`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research