|
|
A253498
|
|
Number of (4+1) X (n+1) 0..2 arrays with every 2 X 2 subblock diagonal minus antidiagonal sum nondecreasing horizontally, vertically and ne-to-sw antidiagonally.
|
|
1
|
|
|
3639, 4720, 6931, 10477, 18526, 37469, 82676, 194708, 483572, 1255700, 3383156, 9387668, 26645492, 76907540, 224670836, 661915028, 1961556212, 5836296980, 17412153716, 52042992788, 155742047732, 466452288020, 1397809159796
(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) for n>9.
Empirical: a(n) = 400*3^(n-3) + 738*2^(n-1) + 3044 for n>6.
Empirical g.f.: x*(3639 - 17114*x + 18640*x^2 - 1023*x^3 + 3585*x^4 - 26*x^5 - 1214*x^6 - 345*x^7 - 54*x^8) / ((1 - x)*(1 - 2*x)*(1 - 3*x)). - Colin Barker, Dec 16 2018
|
|
EXAMPLE
|
Some solutions for n=4:
..2..2..1..1..1....0..2..2..2..2....0..2..2..2..1....0..2..2..2..2
..1..1..0..0..0....1..1..1..1..1....1..1..1..1..0....2..2..2..2..2
..1..1..0..0..0....1..1..1..1..1....1..1..1..1..0....0..0..0..0..0
..2..2..1..1..1....0..0..0..0..0....1..1..1..1..0....2..2..2..2..2
..2..2..1..1..2....0..0..0..0..1....2..2..2..2..1....0..0..0..0..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|