cp's OEIS Frontend

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.

A034343 Number of inequivalent binary linear codes of length n and any dimension k <= n containing no column of zeros.

Original entry on oeis.org

1, 2, 4, 8, 16, 36, 80, 194, 506, 1449, 4631, 17106, 74820, 404283, 2815595, 26390082, 344330452, 6365590987, 167062019455, 6182453531508, 319847262335488, 22968149462624180, 2277881694784784852
Offset: 1

Views

Author

Keywords

Comments

Comment from N. J. A. Sloane, Nov 27 2017 (Start)
Also, (by taking duals) number of inequivalent binary linear codes of length n and any dimension k <= n containing no codewords of weight 1.
It follows from the theorem on page 64 of Schwarzenberger (1980), this is also the number of Bravais types of orthogonal lattices in dimension n. (End)
Also the number of loopless binary matroids on n points.

References

  • R. L. E. Schwarzenberger, N-Dimensional Crystallography. Pitman, London, 1980, pages 64 and 65.
  • M. Wild, Enumeration of binary and ternary matroids and other applications of the Brylawski-Lucas Theorem, Preprint No. 1693, Tech. Hochschule Darmstadt, 1994

Crossrefs

Formula

a(n) = A076832(n,n). - Petros Hadjicostas, Sep 30 2019