|
Search: id:A080910
|
|
|
| A080910 |
|
Number of numbers that differ from n in decimal representation by exactly one edit-operation: deletion, insertion, or substitution. |
|
+0
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; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
a(n) = #{i: LevenshteinDistance(n,i)=1}.
|
|
LINKS
|
Michael Gilleland, Levenshtein Distance. [It has been suggested that this algorithm gives incorrect results sometimes. - njas]
|
|
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
|
Adjacent sequences: A080907 A080908 A080909 this_sequence A080911 A080912 A080913
Sequence in context: A109769 A093018 A003634 this_sequence A036763 A090064 A082804
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 01 2003
|
|
|
Search completed in 0.002 seconds
|
