id:A091092 - OEIS Search Results

Search: id:A091092

Displaying 1-1 of 1 results found.

page 1

In binary representation: minimal number of editing steps (delete, insert or substitute) to transform n into n^2.

+0
4

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

	OFFSET	`0,4`
	COMMENT	`a(n) = A152487(A000290(n),n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 06 2008]`
	LINKS	`Michael Gilleland, Levenshtein Distance [It has been suggested that this algorithm gives incorrect results sometimes. - N. J. A. Sloane (njas(AT)research.att.com)]` `Index entries for sequences related to binary expansion of n` `Eric Weisstein's World of Mathematics, Square Number` `Eric Weisstein's World of Mathematics, Binary`
	FORMULA	`a(n) = LevenshteinDistance(A007088(n), A001737(n)).`
	EXAMPLE	`a(7)=3: 7->'111', 3 x insert a 0 between the last two 1's:` `'110001'->49=7^2.`
	CROSSREFS	`Cf. A091093, A091091, A070939, A000290.` `Sequence in context: A074795 A069577 A130239 this_sequence A083375 A088519 A135034` `Adjacent sequences: A091089 A091090 A091091 this_sequence A091093 A091094 A091095`
	KEYWORD	`nonn,base`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 18 2003`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research