Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110862
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110862 Highest minimal distance of odd formally self-dual binary codes of length 2n. +0
1
1, 2, 3, 3, 4, 4, 4, 5, 5, 6, 7, 7 (list; graph; listen)
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: A156077 A058889 A166724 this_sequence A104257 A048182 A029107

Adjacent sequences: A110859 A110860 A110861 this_sequence A110863 A110864 A110865

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research