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 #6 Oct 01 2021 16:54:31
%S 0,0,0,0,1,0,0,7,7,0,0,38,144,38,0,0,190,2389,2389,190,0,0,918,37114,
%T 120908,37114,918,0,0,4367,561573,5756974,5756974,561573,4367,0,0,
%U 20623,8399702,267947653,838126848,267947653,8399702,20623,0,0,97052,124988061
%N T(n,k) = Number of n X k arrays of occupancy after each element moves to some horizontal or vertical neighbor but without 2-loops.
%C Table starts
%C .0.......0...........0..............0................0.................0
%C .0.......1...........7.............38..............190...............918
%C .0.......7.........144...........2389............37114............561573
%C .0......38........2389.........120908..........5756974.........267947653
%C .0.....190.......37114........5756974........838126848......119394609842
%C .0.....918......561573......267947653.....119394609842....52019083898820
%C .0....4367.....8399702....12350550690...16858052804062.22467362744958042
%C .0...20623...124988061...566789163488.2371064003849290
%C .0...97052..1855434240.25958450760849
%C .0..455960.27513859347
%C .0.2140404
%C .0
%H R. H. Hardin, <a href="/A217346/b217346.txt">Table of n, a(n) for n = 1..84</a>
%e Some solutions for n=3, k=4
%e ..1..1..2..1....1..1..2..1....0..0..2..1....1..0..0..0....1..1..1..1
%e ..2..1..2..0....2..1..1..1....2..2..1..1....2..2..2..2....2..2..1..0
%e ..0..0..2..0....1..1..0..0....1..1..0..1....1..1..0..1....0..1..2..0
%K nonn,tabl
%O 1,8
%A _R. H. Hardin_ Oct 01 2012