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(3+1) 0..2 arrays with the maximum plus the minimum minus the lower median of every 2X2 subblock equal
1

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

%S 1386,15254,168564,1949236,22695802,269108894,3207539588,38599508572,

%T 466275664500,5664487537556,69007333422447,843652458439362,

%U 10335176759901673,126898784204316940,1560376523474291714

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

%C Column 3 of A236828

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

%H R. H. Hardin, <a href="/A236823/a236823.txt">Empirical recurrence of order 84</a>

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

%e Some solutions for n=3

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 31 2014