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 #6 Sep 04 2022 08:29:33
%S 98368,2988228,93754871,3132727426,101302533917,3290316038130,
%T 107344851887817,3521409227180926,114789997988287308,
%U 3740517432332991542,122133013457283295954,3991173170840175703336,130253469314029144279989
%N Number of (n+1) X (5+1) 0..2 arrays colored with the maximum plus the upper median plus the minimum of every 2 X 2 subblock.
%C Column 5 of A236640.
%H R. H. Hardin, <a href="/A236639/b236639.txt">Table of n, a(n) for n = 1..21</a>
%e Some solutions for n=1
%e ..1..2..0..0..1..2....1..0..2..2..2..0....2..1..2..2..0..2....2..1..1..2..1..0
%e ..1..0..0..1..1..0....0..1..2..2..0..1....0..1..1..1..1..2....0..2..0..2..1..1
%Y Cf. A236640.
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 29 2014