|
|
A250461
|
|
Number of (n+1)X(1+1) 0..1 arrays with nondecreasing min(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
|
|
|
11, 31, 85, 233, 637, 1741, 4757, 12997, 35509, 97013, 265045, 724117, 1978325, 5404885, 14766421, 40342613, 110218069, 301121365, 822678869, 2247600469, 6140558677, 16776318293, 45833753941, 125220144469, 342107796821
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 3*a(n-1) - 2*a(n-3).
G.f.: x*(11 - 2*x - 8*x^2) / ((1 - x)*(1 - 2*x - 2*x^2)).
a(n) = (-2 + (13-7*sqrt(3))*(1-sqrt(3))^n + (1+sqrt(3))^n*(13+7*sqrt(3))) / 6.
(End)
|
|
EXAMPLE
|
Some solutions for n=6:
..0..1....0..1....0..1....0..1....0..0....0..1....0..0....0..0....0..1....1..0
..1..0....1..0....0..1....1..0....0..1....0..0....1..0....0..0....0..0....0..0
..0..1....0..1....0..1....0..1....0..0....0..1....0..0....1..0....0..0....1..0
..0..0....0..1....0..1....0..1....1..0....1..0....1..0....0..1....1..0....0..0
..0..1....0..0....1..0....1..0....0..0....0..0....0..1....0..0....0..0....0..0
..0..1....0..0....0..0....0..0....0..1....0..0....0..0....1..0....0..0....0..0
..1..0....1..1....0..0....0..1....1..0....0..1....1..1....0..0....1..0....1..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|