|
Search: id:A115779
|
|
|
| A115779 |
|
Consider the Levenshtein distance between k considered as a decimal string and k considered as a binary string. Then a(n) is the greatest number m such that the Levenshtein distance is n or 0 if no such number exists. |
|
+0
2
|
|
| 1, 0, 11, 15, 111, 121, 1011, 1111, 2011, 11111, 16111, 111111, 131011, 1011111, 1111111, 2011111, 11111111, 16111111
(list; graph; listen)
|
|
|
Search completed in 0.001 seconds
|
