A115779 - cp's OEIS frontend

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.

n	a(n)
0	1
1	0
2	11
3	15
4	111
5	121
6	1011
7	1111
8	2011
9	11111
10	16111
11	111111
12	131011
13	1011111
14	1111111
15	2011111
16	11111111
17	16111111
18	111111111
19	131111111
20	1011111111
21	1111111111
22	2111111111
23	11111111111

[1, 0, 11, 15, 111, 121, 1011, 1111, 2011, 11111, 16111, 111111, 131011, 1011111, 1111111, 2011111, 11111111, 16111111, 111111111, 131111111, 1011111111, 1111111111, 2111111111, 11111111111]

cp's OEIS Frontend

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.

Table of values

List of values