|
|
A236079
|
|
Number of (n+1)X(3+1) 0..2 arrays with the sum of each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise
|
|
1
|
|
|
3992, 169680, 7147799, 271135379, 10003171144, 349054240169, 11883153992874, 392842405587563, 12777894726279097, 409323490817193034, 12991133927138973427, 409163645547902354020, 12825010207733767198505
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=2
..0..0..0..1....0..0..0..0....1..1..1..0....1..2..0..0....0..0..1..2
..0..1..0..0....0..2..2..1....0..0..2..2....2..0..2..2....0..0..1..2
..1..0..1..1....0..2..0..2....2..2..2..1....0..0..1..1....0..1..1..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|