%I #5 Mar 30 2012 16:49:31
%S 1,0,0,1,0,0,1,0,0,1,1,0,0,1,2,1,0,0,1,4,3,1,0,0,0,5,9,4,1,0,0,0,5,22,
%T 19,6,1,0,0,0,4,40,70,35,7,1
%N Triangle T(n,k) read by rows giving number of inequivalent projective indecomposable binary linear [n,k] codes (n >= 1, 1 <= k <= n).
%C A code is projective if all columns are distinct and nonzero.
%D D. Slepian, Some further theory of group codes. Bell System Tech. J. 39 1960 1219-1252.
%H <a href="/index/Coa#codes_binary_linear">Index entries for sequences related to binary linear codes</a>
%e 1; 0; 0,1; 0,0,1; 0,0,1,1; 0,0,1,2,1; 0,0,1,4,3,1; 0,0,0,5,9,4,1; ...
%Y Cf. A076838 (row sums).
%K nonn,tabf,more
%O 1,15
%A _N. J. A. Sloane_, Nov 21 2002