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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111259 Number of inequivalent codes with the minimal distance given in A066016. 1

%I

%S 1,1,1,1,2,1,1,2,11,5,3,39,8,4,47

%N Number of inequivalent codes with the minimal distance given in A066016.

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

%H W. C. Huffman, <a href="https://doi.org/10.1016/j.ffa.2005.05.012">On the classification and enumeration of self-dual codes</a>, Finite Fields Applic., 11 (2005), 451-490.

%H G. Nebe, E. M. Rains and N. J. A. Sloane, <a href="http://neilsloane.com/doc/cliff2.html">Self-Dual Codes and Invariant Theory</a>, Springer, Berlin, 2006.

%K nonn,more

%O 1,5

%A _N. J. A. Sloane_, Nov 02 2005

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 5 12:24 EST 2021. Contains 349557 sequences. (Running on oeis4.)