Lexicographical-support sequence T(n,k), n,k nonnegative: total number of checks required by a "lexicographical" algorithm to find out which rows and columns of each of the n by k zero-one matrices are nonzero.

A058547

Lexicographical-support sequence T(n,k), n,k nonnegative: total number of checks required by a "lexicographical" algorithm to find out which rows and columns of each of the n by k zero-one matrices are nonzero.

Terms

    a(0) =0a(1) =0a(2) =0a(3) =0a(4) =2a(5) =0a(6) =0a(7) =8a(8) =8a(9) =0a(10) =0a(11) =24a(12) =58a(13) =24a(14) =0a(15) =0a(16) =64a(17) =330a(18) =326a(19) =64a(20) =0a(21) =0a(22) =160a(23) =1706a(24) =3550a(25) =1666a(26) =160a(27) =0a(28) =0a(29) =384

External references