%I #10 Apr 11 2017 09:10:52
%S 1,4,1,8,4,1,24,7,4,1,64,16,4,4,1
%N Triangle T(n,k), 1 <= k <= n, giving maximal size of code of length n and covering radius k over alphabet of size 4.
%D G. D. Cohen et al., Covering Codes, North-Holland, 1997, p. 174.
%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 1; 4,1; 8,4,1; 24,7,4,1; ...
%Y Cf. A060438, A060439.
%K nonn,tabl,nice
%O 1,2
%A _N. J. A. Sloane_, Apr 07 2001
%E T(5,2)-T(5,5) from _Andrey Zabolotskiy_, Apr 11 2017 using Gerzson Kéri's tables.