login
Number of (n+1)X(5+1) 0..2 arrays with the maximum plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one
1

%I #4 Feb 05 2014 05:49:13

%S 9628,36180,97862,233536,721854,1737372,5299502,12992080,40059070,

%T 97555340,300177654,731229928,2240228750,5478702380,16794581906,

%U 41072728888,125888770174,307837473900,942852920590,2306978778432

%N Number of (n+1)X(5+1) 0..2 arrays with the maximum plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one

%C Column 5 of A237234

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

%F Empirical: a(n) = 7*a(n-2) +10*a(n-4) +15*a(n-6) -314*a(n-8) -1389*a(n-10) +1365*a(n-12) +3415*a(n-14) +2472*a(n-16) +2424*a(n-18) +3384*a(n-20) -6192*a(n-22) +1152*a(n-24) -2304*a(n-26) for n>29

%e Some solutions for n=3

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 05 2014