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

Number of (n+1)X(2+1) 0..2 arrays colored with the maximum plus the upper median minus the minimum of every 2X2 subblock
1

%I #5 Aug 11 2014 22:46:10

%S 434,3240,24340,183764,1379886,10406596,78612538,593121116,4469323758,

%T 33698637958,254212599808,1917348305880,14457809113682,

%U 109028076862576,822269791408032,6201236835251186,46765472722995182,352677245924001228

%N Number of (n+1)X(2+1) 0..2 arrays colored with the maximum plus the upper median minus the minimum of every 2X2 subblock

%C Column 2 of A237391

%H R. H. Hardin, <a href="/A237386/b237386.txt">Table of n, a(n) for n = 1..210</a>

%H R. H. Hardin, <a href="/A237386/a237386.txt">Empirical recurrence of order 58</a>

%F Empirical recurrence of order 58 (see link above)

%e Some solutions for n=4

%e ..0..0..0....0..2..2....0..2..2....1..1..1....0..2..2....0..2..2....0..2..1

%e ..2..1..1....1..1..0....1..1..0....0..0..2....2..1..2....0..2..2....0..0..0

%e ..1..1..1....0..0..0....1..0..0....0..0..2....1..2..0....0..0..0....0..0..2

%e ..1..1..2....0..1..2....0..0..0....0..1..1....1..1..1....1..0..0....2..0..1

%e ..0..2..0....2..1..1....2..1..0....2..1..0....1..1..2....1..2..2....1..1..0

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 07 2014