%I #13 Oct 19 2013 04:20:30

%S 1,2,2,2,4,5,8,11

%N The size of an optimal binary code of length n and edit distance 5.

%C The edit distance between two words u and v is defined as the minimum number of deletions, insertions, or substitutions required to change u to v.

%H Sheridan Houghten, <a href="http://www.cosc.brocku.ca/~houghten/binaryedit.html">A Table of Bounds on Optimal Fixed-Length Binary Edit-Metric Codes</a>

%Y Cf. A179183, A230380.

%K nonn,more

%O 4,2

%A _Sheridan Houghten_, Oct 17 2013