login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060438 Triangle T(n,k), 1 <= k <= n, giving maximal size of binary code of length n and covering radius k. 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, 62, 16, 7, 2, 2, 2, 2, 2, 1 (list; table; graph; refs; listen; history; text; internal format)
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: A177954 A077053 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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 09:35 EDT 2019. Contains 322385 sequences. (Running on oeis4.)