|
|
A236081
|
|
Number of (n+1) X (5+1) 0..2 arrays with the sum of each 2 X 2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.
|
|
1
|
|
|
167892, 40097396, 10003171144, 2353737191047, 558542932337300, 126138961904040570, 27744841719671138194, 5832339695757183406469, 1183186252204989571469409, 230924323943367731755228208
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=1
..0..0..2..0..0..1....0..0..0..1..1..2....1..0..2..0..2..1....1..0..0..0..1..2
..0..1..2..2..2..2....1..0..1..2..0..0....0..2..0..0..2..2....1..0..2..1..2..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|