|
%I #4 Feb 06 2014 06:05:07
%S 256,1352,1352,7398,12690,7398,42474,120650,120650,42474,246644,
%T 1218584,1928204,1218584,246644,1457838,12256598,33313192,33313192,
%U 12256598,1457838,8652288,126084160,564748168,1008893682,564748168,126084160
%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the lower median minus the minimum of every 2X2 subblock equal
%C Table starts
%C ........256..........1352............7398.............42474.............246644
%C .......1352.........12690..........120650...........1218584...........12256598
%C .......7398........120650.........1928204..........33313192..........564748168
%C ......42474.......1218584........33313192........1008893682........29705879570
%C .....246644......12256598.......564748168.......29705879570......1497953660532
%C ....1457838.....126084160......9923274434......921202878454.....81336374507888
%C ....8652288....1291478032....171975075815....28008850432408...4273223840276532
%C ...51729960...13373871324...3048207305436...882133454021878.236863001850227620
%C ..309766574..138091649434..53496852362572.27361616605419182
%C .1861078542.1434854215354.954253356186506
%H R. H. Hardin, <a href="/A237315/b237315.txt">Table of n, a(n) for n = 1..84</a>
%F Empirical for column k:
%F k=1: [linear recurrence of order 37]
%F k=2: [order 99]
%e Some solutions for n=2 k=4
%e ..0..2..2..2..2....0..0..0..2..1....0..2..1..2..2....0..0..3..2..3
%e ..1..2..3..3..3....3..0..3..0..2....0..3..1..0..1....0..3..0..0..0
%e ..2..2..3..3..3....0..0..0..3..0....0..3..1..2..1....0..0..3..3..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Feb 06 2014
| 