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

 

Logo

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!)
A001647 Number of indecomposable self-dual codes of length 2n over GF(4). 0
1, 0, 1, 1, 2, 4, 10, 31 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

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

J. Conway, V. Pless, N. Sloane, Self-dual codes over GF(3) and GF(4)of length not exceeding 16, IEEE Trans. Information Theory 25 312-322 1979.

F. J. MacWilliams, A. M. Odlyzko, N. J. A. Sloane and H. N. Ward, Self-Dual Codes over GF(4), J. Combin. Theory, A 25 288-318 1978.

E. M. Rains and N. J. A. Sloane, Self-dual codes, pp. 177-294 of Handbook of Coding Theory, Elsevier, 1998 (Abstract, pdf, ps).

CROSSREFS

Sequence in context: A101901 A124384 A280432 * A007177 A328815 A242347

Adjacent sequences:  A001644 A001645 A001646 * A001648 A001649 A001650

KEYWORD

nonn,hard,nice

AUTHOR

N. J. A. Sloane.

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 December 10 18:10 EST 2019. Contains 329901 sequences. (Running on oeis4.)