Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110863
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110863 Number of odd formally self-dual binary codes of length 2n that have the highest possible minimal distance. +0
1
1, 1, 1, 2, 1, 5, 112, 1 (list; graph; listen)
OFFSET

1,4

REFERENCES

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

CROSSREFS

Sequence in context: A013014 A012905 A075403 this_sequence A091615 A155183 A163553

Adjacent sequences: A110860 A110861 A110862 this_sequence A110864 A110865 A110866

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research