A221483 - OEIS

%I #4 Jan 17 2013 17:26:24

%S 0,1,0,0,4,0,1,8,16,0,0,73,50,64,0,1,292,1407,313,256,0,0,1713,11784,

%T 34751,1980,1024,0,1,8235,182524,802711,865318,12494,4096,0,0,43733,

%U 2017564,37622097,48514602,21576814,78880,16384,0,1,220672,26614749

%N T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, without consecutive moves in the same direction

%C Table starts

%C .0.......1........0............1..............0...............1

%C .0.......4........8...........73............292............1713

%C .0......16.......50.........1407..........11784..........182524

%C .0......64......313........34751.........802711........37622097

%C .0.....256.....1980.......865318.......48514602......6681667775

%C .0....1024....12494.....21576814.....2942599561...1224264741193

%C .0....4096....78880....538159483...178388225956.224856636340095

%C .0...16384...497940..13422938865.10813887700409

%C .0...65536..3143384.334800425933

%C .0..262144.19843336

%C .0.1048576

%C .0

%H R. H. Hardin, <a href="/A221483/b221483.txt">Table of n, a(n) for n = 1..85</a>

%e Some solutions for n=3 k=4

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

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

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

%Y Column 2 is A000302(n-1)

%K nonn,tabl

%O 1,5

%A _R. H. Hardin_ Jan 17 2013