This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A060450 Triangle T(n,k) (1 <= k <= n) giving smallest covering radius of any [n,k] binary linear code. 1
 0, 1, 0, 1, 1, 0, 2, 1, 1, 0, 2, 2, 1, 1, 0, 3, 2, 2, 1, 1, 0, 3, 3, 2, 1, 1, 1, 0, 4, 3, 3, 2, 1, 1, 1, 0, 4, 4, 3, 2, 2, 1, 1, 1, 0, 5, 4, 4, 3, 2, 2, 1, 1, 1, 0, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 0, 6, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 0, 6, 6, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 0, 7, 6, 6, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 0 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,7 REFERENCES G. D. Cohen et al., Covering Codes, North-Holland, 1997, p. 193. R. L. Graham and N. J. A. Sloane, On the covering radius of codes, IEEE Trans. Information Theory, 51 (1985), 385-401. LINKS EXAMPLE 0; 1,0; 1,1,0; 2,1,1,0; 2,2,1,1,0; ... CROSSREFS Cf. A060451. Sequence in context: A101979 A308061 A060582 * A180918 A152146 A025860 Adjacent sequences:  A060447 A060448 A060449 * A060451 A060452 A060453 KEYWORD nonn,tabl,nice AUTHOR N. J. A. Sloane, Apr 08 2001 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.

Last modified December 11 12:33 EST 2019. Contains 329916 sequences. (Running on oeis4.)