|
|
A250578
|
|
Number of (n+1) X (3+1) 0..1 arrays with nondecreasing max(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
|
|
|
55, 142, 336, 778, 1779, 4077, 9346, 21510, 49579, 114548, 264881, 613191, 1420035, 3290061, 7623702, 17668834, 40951324, 94920278, 220016344, 509991358, 1182147415, 2740217734, 6351824316, 14723589157, 34129405898, 79112386680
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 5*a(n-1) - 6*a(n-2) - 7*a(n-3) + 21*a(n-4) - 14*a(n-5) - a(n-6) + 4*a(n-7) - a(n-8).
Empirical g.f.: x*(55 - 133*x - 44*x^2 + 335*x^3 - 256*x^4 - 10*x^5 + 68*x^6 - 17*x^7) / ((1 - x)^3*(1 - 2*x - 3*x^2 + 5*x^3 + x^4 - x^5)). - Colin Barker, Nov 15 2018
|
|
EXAMPLE
|
Some solutions for n=6:
..0..0..0..0....0..0..0..0....0..0..1..1....0..0..0..0....0..0..0..0
..0..0..0..1....0..0..0..1....1..0..1..1....0..0..1..1....1..0..0..1
..1..0..1..1....0..0..0..1....0..1..1..1....0..1..0..1....0..1..1..1
..0..1..1..1....0..0..0..1....1..0..1..1....1..0..1..0....1..1..1..1
..1..0..1..1....0..0..0..1....0..1..1..1....0..1..0..1....1..1..1..1
..0..1..1..1....1..0..1..0....1..0..1..1....1..0..1..0....0..1..1..1
..1..1..1..1....0..1..0..1....0..1..1..1....0..1..0..1....1..0..1..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|