|
|
A250579
|
|
Number of (n+1) X (4+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
|
|
|
125, 329, 778, 1776, 4013, 9055, 20510, 46664, 106695, 244907, 564056, 1302196, 3011939, 6975231, 16168980, 37503362, 87027117, 202004681, 468985712, 1088963192, 2528765147, 5872573601, 13638522600, 31675031834, 73565690547
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 6*a(n-1) - 10*a(n-2) - 7*a(n-3) + 40*a(n-4) - 40*a(n-5) - 2*a(n-6) + 29*a(n-7) - 19*a(n-8) + 4*a(n-9) for n>10.
Empirical g.f.: x*(125 - 421*x + 54*x^2 + 1273*x^3 - 1560*x^4 + 23*x^5 + 1032*x^6 - 642*x^7 + 106*x^8 + 8*x^9) / ((1 - x)^4*(1 - 2*x - 4*x^2 + 7*x^3 + 3*x^4 - 4*x^5)). - Colin Barker, Nov 15 2018
|
|
EXAMPLE
|
Some solutions for n=6:
..0..1..0..1..0....1..0..0..1..1....1..0..0..0..0....0..0..0..1..1
..1..0..1..0..1....0..1..1..1..1....0..1..0..1..1....0..0..1..0..1
..0..1..0..1..1....1..0..1..1..1....1..0..1..0..1....0..1..0..1..1
..1..0..1..1..1....0..1..0..1..1....0..1..0..1..0....1..0..1..1..1
..0..1..1..1..1....1..0..1..1..1....1..0..1..0..1....0..1..1..1..1
..0..1..1..1..1....0..1..0..1..1....0..1..0..1..1....0..1..1..1..1
..0..1..1..1..1....1..0..1..1..1....1..0..1..0..1....0..1..1..1..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|