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).

A091006

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).

Terms

    a(0) =1a(1) =0a(2) =0a(3) =0a(4) =1a(5) =0a(6) =0a(7) =0a(8) =1a(9) =0a(10) =0a(11) =0a(12) =1a(13) =1a(14) =0a(15) =0a(16) =0a(17) =1a(18) =2a(19) =1a(20) =0a(21) =0a(22) =0a(23) =1a(24) =4a(25) =3a(26) =1a(27) =0a(28) =0a(29) =0

External references