A221245 - OEIS

%I #4 Jan 06 2013 16:29:32

%S 0,1,0,2,9,0,4,50,64,0,8,484,1056,441,0,16,3864,45369,21660,3025,0,32,

%T 32400,1337130,4096576,441720,20736,0,64,267264,44315649,438377904,

%U 367565584,8997120,142129,0,128,2214144,1404725868,56606878084

%N T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, diagonal or antidiagonal neighbor

%C Table starts

%C .0........1...........2...............4.................8................16

%C .0........9..........50.............484..............3864.............32400

%C .0.......64........1056...........45369...........1337130..........44315649

%C .0......441.......21660.........4096576.........438377904.......56606878084

%C .0.....3025......441720.......367565584......142283547000....71306050492681

%C .0....20736.....8997120.....32940435025....46087307409528.89545789526100625

%C .0...142129...183206016...2951293792489.14921719105582926

%C .0...974169..3730330800.264404315544196

%C .0..6677056.75953515968

%C .0.45765225

%C Even columns are perfect squares

%H R. H. Hardin, <a href="/A221245/b221245.txt">Table of n, a(n) for n = 1..71</a>

%e Some solutions for n=3 k=4

%e ..1..0..1..0....0..0..3..1....0..2..0..0....1..2..0..1....0..1..1..0

%e ..1..1..1..2....0..4..2..0....0..1..4..2....0..0..5..2....0..4..1..0

%e ..1..2..1..1....1..1..0..0....0..0..2..1....0..1..0..0....2..0..2..1

%Y Column 2 is A049684

%K nonn,tabl

%O 1,4

%A _R. H. Hardin_ Jan 06 2013