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”).

A235666
Number of (2+1) X (n+1) 0..3 arrays with the difference between each 2 X 2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise.
1
3038, 105752, 3405756, 98555090, 2711168860, 71121044662, 1810928557276, 44992556226908, 1098636100890368, 26463799388634494, 631069393721184736, 14932511035514783692, 351283388673654775074, 8227223033013741388748
OFFSET
1,1
COMMENTS
Row 2 of A235665.
LINKS
EXAMPLE
Some solutions for n=2
..2..3..1....0..2..0....0..3..0....3..0..0....1..0..3....3..1..0....2..3..3
..2..0..1....3..1..3....1..1..0....2..1..3....1..3..3....2..2..1....1..3..0
..1..0..3....2..3..0....2..3..1....3..3..3....1..3..0....1..0..1....3..2..0
CROSSREFS
Cf. A235665.
Sequence in context: A108706 A235218 A235662 * A235427 A326416 A236297
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 13 2014
STATUS
approved