|
%I #7 Oct 13 2021 00:33:32
%S 1,1,1,1,3,1,2,6,6,2,3,18,1,18,3,6,60,180,180,60,6,10,210,116,2184,
%T 116,210,10,20,756,8016,28440,28440,8016,756,20,35,2772,9746,385316,
%U 150979,385316,9746,2772,35,70,10296,398126,5358022,20021342,20021342,5358022
%N T(n,k) = Half the number of n X k binary arrays with the number of 1-1 horizontal, vertical, diagonal and antidiagonal adjacencies equal to the number of 0-0 adjacencies.
%C Table starts
%C ..1.....1........1...........2..............3.................6
%C ..1.....3........6..........18.............60...............210
%C ..1.....6........1.........180............116..............8016
%C ..2....18......180........2184..........28440............385316
%C ..3....60......116.......28440.........150979..........20021342
%C ..6...210.....8016......385316.......20021342........1085177164
%C .10...756.....9746.....5358022......174883800.......60444425412
%C .20..2772...398126....75912216....15784256016.....3432989914472
%C .35.10296...725872..1090973732...190371233229...197894482415760
%C .70.38610.20910204.15858156696.13214123612340.11543252431044600
%H R. H. Hardin, <a href="/A183289/b183289.txt">Table of n, a(n) for n = 1..2000</a>
%e All solutions for 3 X 3 with a(1,1)=0
%e ..0..1..0
%e ..1..0..1
%e ..0..1..0
%Y Column 1 is A001405(n-2).
%Y Column 2 is 3*A000984(n-2).
%K nonn,tabl
%O 1,5
%A _R. H. Hardin_ Jan 03 2011
|
