|
|
A235667
|
|
Number of (3+1)X(n+1) 0..3 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise
|
|
1
|
|
|
33610, 3377510, 314516602, 25757334784, 1985139761308, 143468661921620, 9943144779735306, 663721389380552504, 43067478348737689590, 2728158285998906700578, 169524380931449477078492
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=1
..0..2....2..0....0..2....3..1....3..0....1..2....0..3....0..0....3..2....0..3
..3..3....2..3....3..2....1..0....3..1....0..2....0..3....3..1....0..3....2..2
..2..3....3..3....2..3....3..3....1..2....2..2....0..3....3..1....0..3....3..1
..3..3....2..3....2..3....1..1....2..1....2..0....2..0....3..2....2..3....3..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|