

A080910


Number of numbers that differ from n in decimal representation by exactly one editoperation: deletion, insertion, or substitution.


4



18, 27, 27, 27, 27, 27, 27, 27, 27, 27, 46, 45, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 45, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 45, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 45, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 45, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 45, 46, 46
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,1


COMMENTS

a(n) = #{i: LevenshteinDistance(n,i)=1}.


LINKS

Table of n, a(n) for n=0..68.
Michael Gilleland, Levenshtein Distance. [It has been suggested that this algorithm gives incorrect results sometimes.  N. J. A. Sloane]


EXAMPLE

n=42: numbers at Levenshtein distance 1 from 42: {2, 4, 12, 22, 32, 40, 41, 43, 44, 45, 46, 47, 48, 49, 52, 62, 72, 82, 92, 142, 242, 342, 402, 412, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 432, 442, 452, 462, 472, 482, 492, 542, 642, 742, 842, 942}, therefore a(42)=46.


CROSSREFS

Sequence in context: A338383 A338385 A220100 * A347826 A036763 A226971
Adjacent sequences: A080907 A080908 A080909 * A080911 A080912 A080913


KEYWORD

nonn,base


AUTHOR

Reinhard Zumkeller, Apr 01 2003


STATUS

approved



