A102481 Table read by rows: T(n,k) = highest minimal weight of additive code of length n over GF(4) containing 2^k words (n >= 1, 1 <= k <= 2n).

1, 1, 2, 2, 1, 1, 3, 3, 2, 2, 1, 1, 4, 4, 3, 3, 2, 2, 1, 1, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 6, 6, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 8, 8, 6, 6, 6, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 9, 9, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 10, 10, 8, 8, 7, 6, 6, 6

Offset

1,3

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..98.

Example

Table begins:
1 1
2 2 1 1
3 3 2 2 1 1
4 4 3 3 2 2 1 1
5 5 4 4 3 3 2 2 1 1
6 6 5 4 4 4 3 2 2 2 1 1

Crossrefs

Cf. A102482.

Sequence in context: A243612 A351902 A230351 * A231201 A348841 A295515

Adjacent sequences: A102478 A102479 A102480 * A102482 A102483 A102484

Keyword

nonn,tabf

Author

N. J. A. Sloane, Feb 24 2005

Status

approved