|
%I #4 Sep 19 2013 17:31:53
%S 4,14,14,50,154,50,176,1494,1494,176,622,13968,34022,13968,622,2196,
%T 129766,717882,717882,129766,2196,7756,1203222,14972226,33330044,
%U 14972226,1203222,7756,27390,11146054,310664552,1520769276,1520769276
%N T(n,k)=Number of nXk 0..3 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1)X(k+1) 0..3 array without adjacent equal elements in the latter
%C Table starts
%C .....4........14...........50.............176..............622.............2196
%C ....14.......154.........1494...........13968...........129766..........1203222
%C ....50......1494........34022..........717882.........14972226........310664552
%C ...176.....13968.......717882........33330044.......1520769276......69027667944
%C ...622....129766.....14972226......1520769276.....151503568022...14999158146398
%C ..2196...1203222....310664552.....69027667944...14999158146398.3239971166331308
%C ..7756..11146054...6441333794...3129534386120.1483911991489430
%C .27390.103236194.133479301256.141829123448362
%H R. H. Hardin, <a href="/A229320/b229320.txt">Table of n, a(n) for n = 1..71</a>
%F Empirical for column k:
%F k=1: a(n) = 3*a(n-1) +2*a(n-2) -a(n-3) +2*a(n-4)
%F k=2: [order 65]
%e Some solutions for n=2 k=4
%e ..3..1..3..0....1..2..3..2....1..2..2..2....1..2..2..0....2..0..1..0
%e ..2..1..2..3....0..3..0..3....2..2..1..2....0..1..0..3....1..2..1..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Sep 19 2013
| 