A233059 Number of (n+1)X(2+1) 0..1 arrays x(i,j) with row sums sum{x(i,j), j=1..2+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing.
13, 47, 161, 564, 1933, 6529, 21904, 72710, 238992, 781279, 2537019, 8187471, 26318697, 84221878, 268396362, 852861982, 2701532776, 8532060967, 26887756403, 84535960052, 265197189246, 830543999898, 2596441897488, 8103132791812
Offset: 1
Keywords
Examples
Some solutions for n=5 ..0..0..1....0..0..1....0..0..0....0..1..0....0..0..0....0..0..1....0..1..0 ..0..0..1....1..0..1....0..0..0....1..0..0....1..1..0....0..0..1....1..0..0 ..1..1..0....1..0..1....1..0..0....0..1..1....0..1..1....0..1..0....0..1..1 ..1..1..0....1..1..0....0..0..1....0..1..1....1..0..1....1..0..1....1..0..1 ..1..0..1....0..1..1....0..1..1....1..1..0....1..0..1....0..1..1....0..1..1 ..0..1..1....1..1..1....1..1..1....1..0..1....0..1..1....0..1..1....1..1..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..35
Comments