The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #4 Jan 15 2014 08:25:40
%S 33640,3493283,351909466,30537258362,2563845268583,197624940459675,
%T 14776689666349119,1049315480753471778,72598830851735754112,
%U 4858264843484096655111,318359623119686331752911
%N Number of (n+1)X(3+1) 0..3 arrays with the sum of each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise
%C Column 3 of A235747
%H R. H. Hardin, <a href="/A235745/b235745.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=1
%e ..1..3..3..3....2..3..1..1....2..1..2..0....1..1..3..2....2..1..2..2
%e ..0..0..0..3....0..0..2..3....1..0..1..0....2..0..1..2....0..0..3..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 15 2014