id:A118757 - OEIS Search Results

Search: id:A118757

Displaying 1-1 of 1 results found.

page 1

Permutation of the natural numbers such that in decimal representation the Levenshtein distance of succeeding terms is exactly 1, a(0)=0.

+0
8

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 39, 38, 37, 36, 35, 34, 33, 32, 31, 30, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 59, 58, 57, 56, 55, 54, 53, 52, 51, 50, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 79, 78, 77 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`a(n) = A003100(n) for n<=100, = a(100)=A003100(100)=190, but a(101)=180, A003100(101)=191;` `a(n+1) = if U(n) is empty then Min(V(n)) else Max(U(n)), where the sets U and V are defined as: U(m) = {x<a(m): = LD10(a(m),x)=1 and a(k)<>x for 0<=k<m}, V(m) = {x>a(m): LD10(a(m),x)=1 and = a(k)<>x for 0<=k<m} with LD10 = Levenshtein distance in decimal representations = of natural numbers;` `inverse: A118758; A118759(n)=a(a(n)); a(A118761(n))=A118761(n);` `a(n) = A118758(n) for n < 100;` `A118762(n) = a(n+1) - a(n).`
	LINKS	`Michael Gilleland, Levenshtein Distance` `R. Zumkeller, Initial values of A118757 for n<=1200` `Index entries for sequences that are permutations of the natural numbers`
	CROSSREFS	`Cf. A118763.` `Sequence in context: A118763 A098488 A003100 this_sequence A118758 A106649 A087121` `Adjacent sequences: A118754 A118755 A118756 this_sequence A118758 A118759 A118760`
	KEYWORD	`nonn,base`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), May 01 2006`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research