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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110862 Highest minimal distance of odd formally self-dual binary codes of length 2n. 0
1, 2, 3, 3, 4, 4, 4, 5, 5, 6, 7, 7 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

REFERENCES

W. C. Huffman, On the classification and enumeration of self-dual codes, Finite Fields Applic., 11 (2005), 451-490.

CROSSREFS

Sequence in context: A189672 A058889 A166724 * A104257 A048182 A029107

Adjacent sequences:  A110859 A110860 A110861 * A110863 A110864 A110865

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Sep 19 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 10:28 EST 2012. Contains 205763 sequences.