%I #5 Mar 30 2012 16:49:04
%S 1,3,2,7,4,3,15,5,5,4,31,9,6,6,5,63,13,7,7,7,6,127,19,11,8,8,8,7,255
%N Triangle T(m,R) (1 <= R <= m) giving shortest possible length n of an [n,n-m] binary linear code with covering radius R.
%D G. D. Cohen et al., Covering Codes, North-Holland, 1997, p. 202.
%H <a href="/index/Coa#covcod">Index entries for sequences related to covering codes</a>
%e 1; 3,2; 7,4,3; 15,5,5,4; 31,9,6,6,5; ...
%Y Cf. A060450.
%K nonn,tabl,nice,hard
%O 1,2
%A _N. J. A. Sloane_, Apr 08 2001
%E The next entry, T(8,2), is 25 or 26.