login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060439 Triangle T(n,k), 1 <= k <= n, giving maximal size of ternary code of length n and covering radius k. 4

%I #21 Jun 29 2015 06:51:52

%S 1,3,1,5,3,1,9,3,3,1,27,8,3,3,1

%N Triangle T(n,k), 1 <= k <= n, giving maximal size of ternary code of length n and covering radius k.

%C Next term, T(6,1), is in range 71-73. - _Kamiel P.F. Verstraten_, Jun 29 2015

%D G. D. Cohen et al., Covering Codes, North-Holland, 1997, p. 174.

%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 <a href="/index/Coa#covcod">Index entries for sequences related to covering codes</a>

%e Triangle starts:

%e 1;

%e 3,1;

%e 5,3,1;

%e 9,3,3,1;

%e ...

%Y First column gives A004044. Cf. A060438, A060440.

%K nonn,tabl,nice,more

%O 1,2

%A _N. J. A. Sloane_, Apr 07 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 16 14:17 EDT 2024. Contains 374349 sequences. (Running on oeis4.)