A180987 T(n,k)=number of nXk binary matrices with rows in lexicographically nonincreasing order and columns in lexicographically strictly increasing order.
2, 1, 3, 0, 3, 4, 0, 1, 6, 5, 0, 0, 4, 10, 6, 0, 0, 1, 10, 15, 7, 0, 0, 0, 5, 20, 21, 8, 0, 0, 0, 1, 15, 35, 28, 9, 0, 0, 0, 0, 6, 35, 56, 36, 10, 0, 0, 0, 0, 1, 21, 70, 84, 45, 11, 0, 0, 0, 0, 0, 7, 56, 126, 120, 55, 12, 0, 0, 0, 0, 0, 1, 28, 126, 210, 165, 66, 13, 0, 0, 0, 0, 0, 0, 8, 84, 252, 330
Offset: 1
Examples
All solutions for 3X3 ..0..1..1....0..1..1....0..1..1....1..1..1 ..0..0..1....0..0..1....0..1..1....0..1..1 ..0..0..0....0..0..1....0..0..1....0..0..1
Links
- R. H. Hardin, Table of n, a(n) for n=1..478
Formula
Conjecture: T(n,k) = A180986(n-k+1,k), k<=n . [From R. J. Mathar, Oct 18 2010]
Comments