%I
%S 1,2,2,4,5,9,13,21
%N The size of an optimal binary code of length n and edit distance 4.
%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 FixedLength Binary EditMetric Codes</a>
%Y Cf. A179183, A230381
%K nonn,more
%O 3,2
%A _Sheridan Houghten_, Oct 17 2013
