A248327 - OEIS

A248327

Levenshtein distance of n and its reversal in decimal representation, cf. A004086.

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 0, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 0, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 0, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 0, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 0, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 0, 2, 2, 1, 2, 2, 2, 2, 2

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,13

COMMENTS

a(n) = number of editing steps (replace, delete and insert) to transform n to A004086(n);

a(A002113(n)) = 0, a(10*A002113(n)) = 1 for n > 0;

a(A248336(n)) = n and a(m) != n for m < A248336(n).

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

Haskell Wiki, Edit distance

WikiBooks: Algorithm Implementation, Levenshtein distance

Wikipedia, Levenshtein distance