|
|
A250806
|
|
Number of (n+1) X (2+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.
|
|
1
|
|
|
100, 379, 1315, 4321, 13735, 42769, 131455, 400681, 1214695, 3669409, 11058895, 33278041, 100036855, 300516049, 902359135, 2708699401, 8129342215, 24394514689, 73196520175, 219615512761, 658898442775, 1976799137329
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 6*a(n-1) - 11*a(n-2) + 6*a(n-3); a(n) = (126*3^n - 99*2^n + 20)/2.
Empirical g.f.: x*(100 - 221*x + 141*x^2) / ((1 - x)*(1 - 2*x)*(1 - 3*x)). - Colin Barker, Nov 20 2018
|
|
EXAMPLE
|
Some solutions for n=4:
..2..1..1....1..0..0....2..2..2....2..2..1....0..0..0....0..0..0....2..0..0
..1..1..1....0..0..0....1..1..1....1..1..1....0..0..0....2..2..2....0..0..0
..1..1..1....2..2..2....2..2..2....1..1..1....1..2..2....2..2..2....0..0..0
..0..1..1....1..1..2....0..1..1....1..1..2....1..2..2....2..2..2....0..0..0
..1..2..2....0..0..1....1..2..2....0..0..2....0..1..2....0..2..2....0..0..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|