|
%I #4 Feb 01 2014 08:29:38
%S 256,1056,1056,4448,6762,4448,19888,44836,44836,19888,89888,326868,
%T 451396,326868,89888,417488,2411550,5345722,5345722,2411550,417488,
%U 1956608,18527054,62508118,109900910,62508118,18527054,1956608,9312576
%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the upper median plus the minimum of every 2X2 subblock equal
%C Table starts
%C .......256........1056...........4448.............19888...............89888
%C ......1056........6762..........44836............326868.............2411550
%C ......4448.......44836.........451396...........5345722............62508118
%C .....19888......326868........5345722.........109900910..........2199548878
%C .....89888.....2411550.......62508118........2199548878.........72805879098
%C ....417488....18527054......789404948.......48719331954.......2754669234544
%C ...1956608...143619570.....9889339846.....1055219565906......99111645582536
%C ...9312576..1138035570...129170196446....24050871268974....3815804319538310
%C ..44619472..9082354564..1678632250620...539501655013126..141806974110918684
%C .215852576.73458657386.22339759369142.12433820388637890.5472746163209520482
%H R. H. Hardin, <a href="/A236911/b236911.txt">Table of n, a(n) for n = 1..112</a>
%F Empirical for column k:
%F k=1: [linear recurrence of order 44]
%e Some solutions for n=2 k=4
%e ..0..3..0..3..2....0..2..2..3..0....0..3..0..1..0....0..1..0..2..2
%e ..2..0..2..1..0....0..3..0..2..0....2..1..2..3..2....2..2..2..2..0
%e ..0..3..0..3..2....0..2..2..3..2....2..2..1..0..0....0..2..0..2..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Feb 01 2014
| 