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 #3 Mar 31 2012 12:35:49
%S 1,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,
%T 0,0,0,0,0,2,21,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,127,613,127,0,0,0,
%U 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,211,16610,58894,16610,211,0,0,0,0,0,0,0,0,0
%N T(n,k)=number of nXk binary matrices with rows and columns each in strictly increasing order as binary numbers and each row and column having an odd number of 1s
%C Table starts
%C .1.0.0.0...0......0.......0..........0...........0..............0
%C .0.1.0.0...0......0.......0..........0...........0..............0
%C .0.0.1.0...0......0.......0..........0...........0..............0
%C .0.0.0.3...0......2.......0..........0...........0..............0
%C .0.0.0.0..21......0.....127..........0.........211..............0
%C .0.0.0.2...0....613.......0......16610...........0.........173337
%C .0.0.0.0.127......0...58894..........0.....5724089..............0
%C .0.0.0.0...0..16610.......0...17001258...........0.....5560851506
%C .0.0.0.0.211......0.5724089..........0.14824281524..............0
%C .0.0.0.0...0.173337.......0.5560851506...........0.39871721434052
%H R. H. Hardin, <a href="/A181000/b181000.txt">Table of n, a(n) for n=1..220</a>
%e All solutions for 3X3
%e ..0..0..1
%e ..0..1..0
%e ..1..0..0
%K nonn,tabl
%O 1,25
%A _R. H. Hardin_ Sep 30 2010