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.
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.
Terms
- a(0) =1a(1) =0a(2) =11a(3) =15a(4) =111a(5) =121a(6) =1011a(7) =1111a(8) =2011a(9) =11111a(10) =16111a(11) =111111a(12) =131011a(13) =1011111a(14) =1111111a(15) =2011111a(16) =11111111a(17) =16111111a(18) =111111111a(19) =131111111a(20) =1011111111a(21) =1111111111a(22) =2111111111a(23) =11111111111
External references
- oeis: A115779