cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A066017 Number of inequivalent codes attaining highest minimal Hamming distance of any Type 4^Z self-dual code of length n over Z/4Z.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 1, 11, 5, 3, 39, 8, 4, 47
Offset: 1

Views

Author

N. J. A. Sloane, Dec 12 2001; revised May 06 2005

Keywords

Comments

There are two versions of this sequence, this and A111259. I am not sure which is correct.

Crossrefs

Cf. A066015 for minimal distance. See also A066012-A066016.