A250742 T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nonincreasing x(i,j)-x(i-1,j) in the j direction.
6, 10, 10, 18, 14, 18, 34, 22, 22, 34, 66, 38, 30, 38, 66, 130, 70, 46, 46, 70, 130, 258, 134, 78, 62, 78, 134, 258, 514, 262, 142, 94, 94, 142, 262, 514, 1026, 518, 270, 158, 126, 158, 270, 518, 1026, 2050, 1030, 526, 286, 190, 190, 286, 526, 1030, 2050, 4098, 2054, 1038
Offset: 1
Examples
Some solutions for n=4 k=4 ..0..0..0..0..0....1..0..1..0..1....0..1..0..0..1....1..1..1..1..1 ..0..0..0..0..0....1..0..1..0..1....0..1..0..0..1....1..1..1..1..1 ..0..0..0..0..0....1..0..1..0..1....0..1..0..0..1....0..0..0..0..0 ..1..1..1..1..1....1..0..1..0..1....0..1..0..0..1....0..0..0..0..0 ..1..1..1..1..1....1..0..1..0..1....0..1..0..0..1....1..1..1..1..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..1450
Formula
The constraints apparently result in horizontally or vertically banded arrays, hence:
Empirical: T(n,k) = 2^(k+1)+2^(n+1)-2
Empirical for column k:
k=1: a(n) = 3*a(n-1) -2*a(n-2); a(n) = 2^(n+1) +2
k=2: a(n) = 3*a(n-1) -2*a(n-2); a(n) = 2^(n+1) +6
k=3: a(n) = 3*a(n-1) -2*a(n-2); a(n) = 2^(n+1) +14
k=4: a(n) = 3*a(n-1) -2*a(n-2); a(n) = 2^(n+1) +30
k=5: a(n) = 3*a(n-1) -2*a(n-2); a(n) = 2^(n+1) +62
k=6: a(n) = 3*a(n-1) -2*a(n-2); a(n) = 2^(n+1) +126
k=7: a(n) = 3*a(n-1) -2*a(n-2); a(n) = 2^(n+1) +254
Comments