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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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, 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 (list; graph; refs; listen; history; text; internal format)
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: A272351 A243612 A230351 * A231201 A295515 A110659

Adjacent sequences:  A102478 A102479 A102480 * A102482 A102483 A102484

KEYWORD

nonn,tabf

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 September 20 16:48 EDT 2019. Contains 327242 sequences. (Running on oeis4.)