Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Oct 22 2012 23:24:08
%S 4,4,4,16,28,16,36,192,192,36,94,956,2936,956,94,236,5494,33152,33152,
%T 5494,236,602,30888,434210,851332,434210,30888,602,1528,172038,
%U 5528352,25006046,25006046,5528352,172038,1528,3882,964828,70125438,710907184
%N T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal and vertical neighbors in a random 0..3 nXk array
%C Table starts
%C .....4.........4...........16.............36..............94..............236
%C .....4........28..........192............956............5494............30888
%C ....16.......192.........2936..........33152..........434210..........5528352
%C ....36.......956........33152.........851332........25006046........710907184
%C ....94......5494.......434210.......25006046......1661620524.....106842964082
%C ...236.....30888......5528352......710907184....106842964082...15513264742256
%C ...602....172038.....70125438....20223079322...6885852440176.2257342895377582
%C ..1528....964828....894288072...577891946796.445345491313290
%C ..3882...5400158..11389420426.16478399529602
%C ..9858..30225794.145014350614
%C .25038.169223054
%C .63592
%H R. H. Hardin, <a href="/A218181/b218181.txt">Table of n, a(n) for n = 1..84</a>
%e Some solutions for n=3 k=4
%e ..1..1..1..3....1..1..1..3....0..0..0..0....0..0..0..0....2..1..0..0
%e ..3..1..1..1....1..0..1..3....1..0..0..0....2..0..0..0....2..0..0..0
%e ..3..2..1..1....0..0..0..3....3..3..3..0....2..3..1..3....3..0..0..0
%Y Column 1 is A218051
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Oct 22 2012