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

Author

N. J. A. Sloane, Apr 07 2001

Keywords

• nonn
• tabl
• nice
• more

Examples

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

References

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

Links

• 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

Crossrefs

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

Extensions

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