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 21 2014 03:46:23
%S 3208,103364,3307762,107457398,3483281438,112721511432,3649163332072,
%T 118181547860408,3826764790922336,123905733091963272,
%U 4012061137579007982,129911986254800134186,4206545167113714778518,136207543548570059061308
%N Number of (n+1)X(2+1) 0..3 arrays colored with the maximum plus the upper median plus the lower median of every 2X2 subblock
%C Column 2 of A236254
%H R. H. Hardin, <a href="/A236252/b236252.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=2
%e ..3..0..0....3..1..1....0..2..3....1..1..0....3..1..0....0..0..3....1..3..0
%e ..2..0..0....2..0..2....2..1..0....0..2..3....3..0..0....2..0..1....1..3..0
%e ..1..1..0....1..2..3....3..3..0....0..3..3....1..0..3....1..1..0....2..1..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 21 2014