login
T(n,k)=Number of (n+1)X(k+1) 0..3 arrays colored with the difference of the upper median and the minimum in each 2X2 subblock
5

%I #4 Jan 19 2014 07:13:43

%S 256,2400,2400,22506,38640,22506,211560,601166,601166,211560,1998580,

%T 9486338,15352800,9486338,1998580,18841712,150467212,392462578,

%U 392462578,150467212,18841712,177646290,2390621976,10285907173,16839382568

%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays colored with the difference of the upper median and the minimum in each 2X2 subblock

%C Table starts

%C ..........256..........2400...........22506...........211560..........1998580

%C .........2400.........38640..........601166..........9486338........150467212

%C ........22506........601166........15352800........392462578......10285907173

%C .......211560.......9486338.......392462578......16839382568.....744464574416

%C ......1998580.....150467212.....10285907173.....744464574416...56798079444644

%C .....18841712....2390621976....269065203004...32986703622348.4323926716029622

%C ....177646290...37935191948...7036190023429.1453213042220010

%C ...1674513256..601817039030.183374695218144

%C ..15787986826.9550523506046

%C .148843166800

%H R. H. Hardin, <a href="/A236087/b236087.txt">Table of n, a(n) for n = 1..59</a>

%F Empirical for column k:

%F k=1: [linear recurrence of order 29]

%e Some solutions for n=2 k=4

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

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

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

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_, Jan 19 2014