|
Search: id:A060438
|
|
|
| A060438 |
|
Triangle T(n,k), 1 <= k <= n, giving maximal size of binary code of length n and covering radius k. |
|
+0
5
|
|
| 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
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
G. D. Cohen et al., Covering Codes, North-Holland, 1997, p. 166.
W. Haas, Binary and ternary codes of covering radius one ..., Discrete Math., 245 (2002), 161-178.
|
|
LINKS
|
Index entries for sequences related to covering codes
|
|
EXAMPLE
|
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: A055184 A035388 A077053 this_sequence A106190 A029290 A115311
Adjacent sequences: A060435 A060436 A060437 this_sequence A060439 A060440 A060441
|
|
KEYWORD
|
nonn,tabl,nice
|
|
AUTHOR
|
njas, Apr 07 2001
|
|
EXTENSIONS
|
Next term, T(9,1), is in range 55-62.
|
|
|
Search completed in 0.002 seconds
|
