|
%I #8 Feb 07 2014 19:28:40
%S 256,1540,1540,9296,13924,9296,58088,126848,126848,58088,363220,
%T 1200450,1748190,1200450,363220,2273712,11356368,25159676,25159676,
%U 11356368,2273712,14242608,107575258,361453184,555327358,361453184,107575258
%N T(n,k) = number of (n+1) X (k+1) 0..3 arrays with the maximum plus the upper median plus the lower median minus the minimum of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.
%C Table starts
%C ........256........1540..........9296.........58088.........363220
%C .......1540.......13924........126848.......1200450.......11356368
%C .......9296......126848.......1748190......25159676......361453184
%C ......58088.....1200450......25159676.....555327358....12223260408
%C .....363220....11356368.....361453184...12223260408...411909381794
%C ....2273712...107575258....5197555932..269190640070.13882584141744
%C ...14242608..1019532240...74749364118.5926795463268
%C ...89287168..9677144372.1077627856648
%C ..559586448.91828244608
%C .3506120448
%H R. H. Hardin, <a href="/A237403/b237403.txt">Table of n, a(n) for n = 1..60</a>
%F Empirical for column k:
%F k=1: [linear recurrence of order 40] for n>43.
%e Some solutions for n=2 k=4
%e ..2..3..2..3..0....0..3..0..3..0....2..2..2..0..0....2..0..2..1..0
%e ..2..3..1..0..2....2..0..1..1..2....2..0..1..3..2....2..0..3..2..2
%e ..3..1..3..1..3....2..0..2..0..2....2..3..2..3..2....0..3..0..2..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Feb 07 2014
| 