4194322

Appears in sequences

• 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.at n=23A115778
• a(n) = smallest multiple of n which is >= 2^n.at n=21A128093
• Row sums of triangle A132737.at n=21A132738
• If the binary expansion of A354780(n) is 1 d_1 d_2 ... d_k, then the binary expansion of a(n) is c_1 c_2 ... c_k, where c_i = 1 - d_i.at n=31A354781
• If the binary expansion of A354757(n) is 1 d_1 d_2 ... d_k, then the binary expansion of a(n) is c_1 c_2 ... c_k, where c_i = 1 - d_i.at n=64A354783
• a(n) is the unique k such that A357961(k) = 2^n.at n=22A357993