This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A296086 #35 Jan 07 2019 14:15:57 %S A296086 1,1,1,1,2,1,1,3,2,7,1,1,1,3,13,8,938,41 %N A296086 Number of binary self-dual codes of length 2n (up to permutation equivalence) having the highest possible minimum distance. %C A296086 Gives the number of binary self-dual codes of length 2n (up to permutation equivalence) that have the highest possible minimum distance. %H A296086 W. Cary Huffman and Vera Pless, <a href="https://doi.org/10.1017/CBO9780511807077">Fundamentals of Error Correcting Codes</a>, Cambridge University Press, 2003, Pages 7,252-282,338-393. %H A296086 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. %e A296086 The sequence A005137 says that the maximum value for the minimum distance of a binary self-dual code of length 20 is A005137(10) = 4. There are a(10)=7 binary self-dual codes of length 2*10 = 20 that have minimum distance 4. %Y A296086 Cf. A005137. %K A296086 nonn,more %O A296086 1,5 %A A296086 _Nathan J. Russell_, Nov 24 2018