login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,1
COMMENTS
Column 3 of A236082
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
Sequence in context: A235434 A200848 A235739 * A045262 A203088 A061700
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 19 2014
STATUS
approved