login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A110863
Number of odd formally self-dual binary codes of length 2n that have the highest possible minimal distance.
0
1, 1, 1, 2, 1, 5, 112, 1
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
1,4
LINKS
Table of n, a(n) for n=1..8.
W. C. Huffman,
On the classification and enumeration of self-dual codes
, Finite Fields Applic., 11 (2005), 451-490.
CROSSREFS
Sequence in context:
A343018
A323500
A277471
*
A215219
A335931
A091615
Adjacent sequences:
A110860
A110861
A110862
*
A110864
A110865
A110866
KEYWORD
nonn
,
more
AUTHOR
N. J. A. Sloane
, Sep 19 2005
STATUS
approved
Lookup
|
Welcome
|
Wiki
|
Register
|
Music
|
Plot 2
|
Demos
|
Index
|
Browse
|
More
|
WebCam
Contribute new seq. or comment
|
Format
|
Style Sheet
|
Transforms
|
Superseeker
|
Recents
The OEIS Community
| Maintained by
The OEIS Foundation Inc.
License Agreements, Terms of Use, Privacy Policy.
.
Last modified April 26 10:21 EDT 2024. Contains 371994 sequences. (Running on oeis4.)