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.

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.

Terms

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

External references