|
%I #9 Oct 04 2012 10:28:49
%S 1,0,1,1,1,1,0,1,1,1,1,2,3,2,1,0,2,4,4,2,1,1,3,8,10,7,3,1,0,3,9,18,16,
%T 9,3,1
%N Triangle T(n,k) read by rows giving number of inequivalent even binary linear [n,k] codes containing no zero columns (n >= 2, 1 <= k <= n-1).
%C "Even" means that every word has even weight. Equivalently, the all-ones vector is in the dual code.
%C Difference between successive rows of A091325.
%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 <a href="/index/Coa#codes_binary_linear">Index entries for sequences related to binary linear codes</a>
%e Triangle begins
%e 1
%e 0 1
%e 1 1 1
%e 0 1 1 1
%e 1 2 3 2 1
%e 0 2 4 4 2 1
%Y Cf. A091325. Row sums give A091328.
%K nonn,tabl,more
%O 2,12
%A _N. J. A. Sloane_, Mar 01 2004
|
