|
%I #4 Jan 15 2013 07:34:34
%S 0,2,2,0,6,0,4,16,16,4,0,44,0,44,0,8,120,436,436,120,8,0,328,0,4518,0,
%T 328,0,16,896,12668,47156,47156,12668,896,16,0,2448,0,492102,0,492102,
%U 0,2448,0,32,6688,368268,5133044,18852560,18852560,5133044,368268,6688,32
%N T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some horizontal or vertical neighbor, with every occupancy equal to zero or two
%C Table starts
%C ..0.....2........0.........4..........0...........8...........0............16
%C ..2.....6.......16........44........120.........328.........896..........2448
%C ..0....16........0.......436..........0.......12668...........0........368268
%C ..4....44......436......4518......47156......492102.....5133044......53529806
%C ..0...120........0.....47156..........0....18852560...........0....7505597654
%C ..8...328....12668....492102...18852560...722442370.27665242848.1058237377670
%C ..0...896........0...5133044..........0.27665242848
%C .16..2448...368268..53529806.7505597654
%C ..0..6688........0.558164472
%C .32.18272.10705360
%C ..0.49920
%C .64
%H R. H. Hardin, <a href="/A221408/b221408.txt">Table of n, a(n) for n = 1..84</a>
%e Some solutions for n=3 k=4
%e ..2..2..0..2....2..0..2..0....2..0..2..2....2..0..2..0....0..2..2..0
%e ..0..0..0..0....0..2..2..0....0..0..2..0....2..2..2..0....2..0..0..0
%e ..2..2..2..0....2..0..0..2....0..2..2..0....0..0..2..0....2..2..0..2
%Y Column 1 is A077957
%Y Column 2 is A002605(n+1)
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_ Jan 15 2013
|
