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 #5 Mar 30 2012 16:49:51
%S 1,0,1,0,1,2,0,0,2,3,0,0,1,4,5,0,0,1,5,9,10,0,0,1,6,14,19,20,0,0,0,6,
%T 21,35,41,42,0,0,0,5,34,72,94,101,102,0,0,0,4,50,155,235,267,275,276,
%U 0,0,0,3,67,340,652,803,847,856,857,0,0,0,2,91,791,2076,2897
%N Triangle T(n,k) read by rows giving number of inequivalent binary linear [n,k] codes with all columns distinct (projective codes) (n >= 1, 1 <= k <= n).
%H H. Fripertinger, <a href="http://www.mathe2.uni-bayreuth.de/frib/codes/tables.html">Isometry Classes of Codes</a>
%H <a href="/index/Coa#codes_binary_linear">Index entries for sequences related to binary linear codes</a>
%Y A076834 gives last diagonal. Running sums across rows of triangle A076833.
%K nonn,tabl
%O 1,6
%A _N. J. A. Sloane_, Mar 01 2004