login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102482 Table read by rows: T(n,k) = highest minimal weight of linear code of length n over GF(4) containing 4^k words (n >= 1, 1 <= k <= n). 1
1, 2, 1, 3, 2, 1, 4, 3, 2, 1, 5, 4, 3, 2, 1, 6, 4, 4, 2, 2, 1, 7, 5, 4, 3, 2, 2, 1, 8, 6, 5, 4, 3, 2, 2, 1, 9, 7, 6, 5, 4, 3, 2, 2, 1, 10, 8, 6, 6, 5, 4, 3, 2, 2, 1, 11, 8, 7, 6, 6, 5, 4, 3, 2, 2, 1, 12, 9, 8, 7, 6, 6, 4, 4, 3, 2, 2, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

A. Blokhuis and A. E. Brouwer, Some small additive quaternary codes, Europ. J. Combin., 25 (2004), 161-167.

LINKS

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

EXAMPLE

Table begins:

1

2 1

3 2 1

4 3 2 1

5 4 3 2 1

6 4 4 2 2 1

7 5 4 3 2 2 1

CROSSREFS

Cf. A102481.

Sequence in context: A088643 A226620 A194877 * A194908 A004736 A200370

Adjacent sequences:  A102479 A102480 A102481 * A102483 A102484 A102485

KEYWORD

nonn,tabl

AUTHOR

N. J. A. Sloane, Feb 24 2005

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 October 25 17:22 EDT 2021. Contains 348255 sequences. (Running on oeis4.)