|
%I #4 Feb 13 2014 06:45:58
%S 256,1902,1902,14369,26230,14369,108626,367726,367726,108626,822482,
%T 5195344,9679862,5195344,822482,6206506,73170922,256311790,256311790,
%U 73170922,6206506,46951577,1029281994,6776019974,12795841200,6776019974
%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the minimum minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one
%C Table starts
%C .........256...........1902.............14369..............108626
%C ........1902..........26230............367726.............5195344
%C .......14369.........367726...........9679862...........256311790
%C ......108626........5195344.........256311790.........12795841200
%C ......822482.......73170922........6776019974........635807130472
%C .....6206506.....1029281994......178512761384......31548627779530
%C ....46951577....14489762434.....4719215160352....1566949786889880
%C ...354492388...204068007444...124491992110564...77875021827170574
%C ..2682430004..2873241939356..3291189351446428.3868675262695142732
%C .20249512232.40449727138522.86781113390907628
%H R. H. Hardin, <a href="/A237791/b237791.txt">Table of n, a(n) for n = 1..83</a>
%F Empirical for column k:
%F k=1: [linear recurrence of order 30]
%e Some solutions for n=2 k=4
%e ..0..0..2..2..3....0..2..2..0..0....0..2..2..2..1....0..2..0..2..0
%e ..0..1..3..2..1....2..1..1..2..0....2..1..3..3..2....1..3..2..2..1
%e ..1..3..1..2..0....1..1..3..3..0....0..3..1..0..0....1..1..0..1..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Feb 13 2014
| 