login
Triangle T(n,k) read by rows giving number of inequivalent indecomposable binary linear [n,k] codes with all columns distinct (projective codes) (n >= 1, 1 <= k <= n).
0

%I #5 Mar 30 2012 16:49:51

%S 1,0,0,0,1,0,0,0,1,0,0,0,1,1,0,0,0,1,2,1,0,0,0,1,4,3,1,0,0,0,0,5,9,4,

%T 1,0,0,0,0,5,22,19,6,1,0,0,0,0,4,40,70,35,7,1,0,0,0,0,3,60,220,190,59,

%U 9,1,0,0,0,0,2,86,629,977,466,96,11,1,0,0,0,0,1,110,1700

%N Triangle T(n,k) read by rows giving number of inequivalent indecomposable 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>

%e 1; 0,0; 0,1,0; 0,0,1,0; 0,0,1,1,0; 0,0,1,2,1,0; ...

%K nonn,tabl

%O 1,19

%A _N. J. A. Sloane_, Mar 01 2004