|
|
A250807
|
|
Number of (n+1) X (3+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
|
|
|
225, 873, 3081, 10233, 32745, 102393, 315561, 963513, 2924265, 8840313, 26656041, 80238393, 241255785, 724848633, 2176708521, 6534450873, 19612003305, 58853311353, 176594537001, 529852816953, 1589696862825, 4769367412473
(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) = (304*3^n - 264*2^n + 66)/2.
Empirical g.f.: 3*x*(75 - 159*x + 106*x^2) / ((1 - x)*(1 - 2*x)*(1 - 3*x)). - Colin Barker, Nov 20 2018
|
|
EXAMPLE
|
Some solutions for n=4:
..2..2..2..1....2..2..2..2....2..1..0..0....2..2..2..2....0..0..0..0
..1..1..1..1....2..2..2..2....0..0..0..0....0..0..0..0....0..0..0..0
..1..1..1..1....2..2..2..2....1..1..1..1....1..1..1..1....0..0..0..1
..0..0..0..0....0..0..0..0....0..0..0..0....0..1..1..1....0..0..0..1
..0..0..0..0....0..1..2..2....0..0..1..1....0..1..1..1....0..0..0..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|