id:A091110 - OEIS Search Results

Search: id:A091110

Displaying 1-1 of 1 results found.

page 1

Number of editing steps (deletion, insertion, or substitution) to transform the binary representation of n into the ternary representation of n.

+0
2

0, 2, 1, 2, 2, 2, 2, 4, 1, 1, 2, 1, 1, 2, 3, 4, 4, 3, 3, 4, 3, 3, 4, 4, 4, 5, 3, 3, 3, 2, 2, 4, 3, 3, 4, 2, 2, 4, 3, 4, 4, 3, 3, 4, 4, 4, 5, 4, 4, 4, 4, 4, 5, 4, 4, 4, 4, 4, 4, 5, 5, 6, 5, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 5, 5, 6, 6, 6, 7, 2, 2, 3, 2, 2, 3, 4, 4, 4, 2, 2, 3, 2, 2, 3, 4, 4, 5, 4, 4, 4, 3 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(A091111(n))=n and a(m)>n for m>A091111(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`
	FORMULA	`a(n) = LevenshteinDistance(A007088(n), A007088(n)).`
	CROSSREFS	`Sequence in context: A029215 A030371 A029550 this_sequence A104659 A077197 A117173` `Adjacent sequences: A091107 A091108 A091109 this_sequence A091111 A091112 A091113`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Dec 20 2003`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research