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

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, 2, 2, 2, 1, 62, 16, 7, 2, 2, 2, 2, 2, 1

Offset

1,2

References

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

Links

Table of n, a(n) for n=1..45.

W. Haas, Binary and ternary codes of covering radius one: some new lower bounds, Discrete Math., 245 (2002), 161-178.

Gerzson Kéri, Tables for Bounds on Covering Codes.

Index entries for sequences related to covering codes

Example

Triangle starts:
1;
2,1;
2,2,1;
4,2,2,1;
7,2,2,2,1;
...

Crossrefs

Columns give A000983, A029866. Cf. A060439, A060440.

Sequence in context: A344651 A308558 A105272 * A106190 A029290 A115311

Adjacent sequences: A060435 A060436 A060437 * A060439 A060440 A060441

Keyword

nonn,tabl,nice,more

Author

N. J. A. Sloane, Apr 07 2001

Extensions

Row 9 from Andrey Zabolotskiy, Apr 11 2017 using Gerzson Kéri's tables.

Status

approved