|
%I #3 Mar 30 2012 18:51:05
%S 0,1,4,6,9,10,12,16,18,21,22,25,28,30,33,36,40,42,45,46,49,52,57,58,
%T 60,65,66,69,70,72,75,77,78,81,82,88,96,100,102,105,106,108,112,119,
%U 123,125,126,129,130,136,138,145,148,150,153,156,161,162,165,166,169,172
%N 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.
%C A171400(a(n))=1; BinaryLevenshteinDistance(a(n),A007918(a(n)))=1;
%C A006093 is a subsequence apart from the second term A006093(2)=2;
%C A036987((a(n) XOR A007918(a(n))) - 1) = 1 for n<>2.
%H R. Zumkeller, <a href="/A171401/b171401.txt">Table of n, a(n) for n = 1..700</a>
%H Michael Gilleland, <a href="http://www.merriampark.com/ld.htm">Levenshtein Distance</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Levenshtein_distance">Levenshtein Distance</a>
%K base,nonn
%O 1,3
%A _Reinhard Zumkeller_, Dec 08 2009
|
