|
%I #15 Apr 11 2017 09:10:43
%S 1,2,1,2,2,1,4,2,2,1,7,2,2,2,1,12,4,2,2,2,1,16,7,2,2,2,2,1,32,12,4,2,
%T 2,2,2,1,62,16,7,2,2,2,2,2,1
%N Triangle T(n,k), 1 <= k <= n, giving maximal size of binary code of length n and covering radius k.
%D G. D. Cohen et al., Covering Codes, North-Holland, 1997, p. 166.
%H W. Haas, <a href="http://dx.doi.org/10.1016/S0012-365X(00)00461-1">Binary and ternary codes of covering radius one: some new lower bounds</a>, Discrete Math., 245 (2002), 161-178.
%H Gerzson Kéri, <a href="http://old.sztaki.hu/~keri/codes/">Tables for Bounds on Covering Codes</a>.
%H <a href="/index/Coa#covcod">Index entries for sequences related to covering codes</a>
%e Triangle starts:
%e 1;
%e 2,1;
%e 2,2,1;
%e 4,2,2,1;
%e 7,2,2,2,1;
%e ...
%Y Columns give A000983, A029866. Cf. A060439, A060440.
%K nonn,tabl,nice,more
%O 1,2
%A _N. J. A. Sloane_, Apr 07 2001
%E Row 9 from _Andrey Zabolotskiy_, Apr 11 2017 using Gerzson Kéri's tables.
|
