A115778 - cp's OEIS frontend

A115778 Consider the Levenshtein distance between k considered as a decimal string and k considered as a binary string. Then a(n) is the least number m such that the Levenshtein distance is n or 0 if no such number exists.

n	a(n)
0	1
1	0
2	2
3	4
4	8
5	22
6	32
7	64
8	222
9	256
10	512
11	2044
12	2222
13	4222
14	8192
15	22222
16	32768
17	65536
18	222222
19	262144
20	524288
21	2097152
22	2222222
23	4194322
24	8388622
25	22222222
26	33554432
27	67222222
28	222222222
29	268435456
30	536872222
31	2147483650
32	2147483648
33	4294967296
34	8589934592
35	22222222222

[1, 0, 2, 4, 8, 22, 32, 64, 222, 256, 512, 2044, 2222, 4222, 8192, 22222, 32768, 65536, 222222, 262144, 524288, 2097152, 2222222, 4194322, 8388622, 22222222, 33554432, 67222222, 222222222, 268435456, 536872222, 2147483650, 2147483648, 4294967296, 8589934592, 22222222222]

cp's OEIS Frontend

A115778 Consider the Levenshtein distance between k considered as a decimal string and k considered as a binary string. Then a(n) is the least number m such that the Levenshtein distance is n or 0 if no such number exists.

Table of values

List of values