A171401 Numbers m such that exactly one editing step (insert or substitute) is necessary to transform the binary representation of m into the least prime not less than m.

0, 1, 4, 6, 9, 10, 12, 16, 18, 21, 22, 25, 28, 30, 33, 36, 40, 42, 45, 46, 49, 52, 57, 58, 60, 65, 66, 69, 70, 72, 75, 77, 78, 81, 82, 88, 96, 100, 102, 105, 106, 108, 112, 119, 123, 125, 126, 129, 130, 136, 138, 145, 148, 150, 153, 156, 161, 162, 165, 166, 169, 172

Offset: 1

Author

Reinhard Zumkeller, Dec 08 2009

Keywords

• base
• nonn

Comments

A171400(a(n))=1; BinaryLevenshteinDistance(a(n),A007918(a(n)))=1;

A006093 is a subsequence apart from the second term A006093(2)=2;

A036987((a(n) XOR A007918(a(n))) - 1) = 1 for n<>2.

Links

• R. Zumkeller, Table of n, a(n) for n = 1..700
• Michael Gilleland, Levenshtein Distance
• Wikipedia, Levenshtein Distance