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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I M0356 #21 Jan 31 2022 01:20:23
%S 1,1,0,0,1,0,1,1,2,2,6,8,26,45,148,457,2523,20786
%N Number of indecomposable self-dual binary codes of length 2n.
%D R. T. Bilous, Enumeration of binary self-dual codes of length 34, Preprint, 2005.
%D R. T. Bilous and G. H. J. van Rees, An enumeration of binary self-dual codes of length 32, Designs, Codes Crypt., 26 (2002), 61-86.
%D J. H. Conway and V. S. Pless, On the enumeration of self-dual codes, J. Comb. Theory, A28 (1980), 26-53.
%D V. S. Pless, The children of the (32,16) doubly even codes, IEEE Trans. Inform. Theory, 24 (1978), 738-746.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%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.
%H J. H. Conway, V. Pless and N. J. A. Sloane, The Binary Self-Dual Codes of Length Up to 32: A Revised Enumeration, J. Comb. Theory, A28 (1980), 26-53 (<a href="http://neilsloane.com/doc/pless.txt">Abstract</a>, <a href="http://neilsloane.com/doc/pless.pdf">pdf</a>, <a href="http://neilsloane.com/doc/pless.ps">ps</a>, <a href="http://neilsloane.com/doc/plesstaba.ps">Table A</a>, <a href="http://neilsloane.com/doc/plesstabd.ps">Table D</a>).
%H E. M. Rains and N. J. A. Sloane, Self-dual codes, pp. 177-294 of Handbook of Coding Theory, Elsevier, 1998 (<a href="http://neilsloane.com/doc/self.txt">Abstract</a>, <a href="http://neilsloane.com/doc/self.pdf">pdf</a>, <a href="http://neilsloane.com/doc/self.ps">ps</a>).
%Y Cf. A003179, A028362, A028363. Equals A106162 + A106164.
%K nonn,hard,more,nice
%O 0,9
%A _N. J. A. Sloane_
%E a(16) corrected and a(17) added by _N. J. A. Sloane_, based on data in Bilous's paper, Sep 06 2005