|
%I #4 Oct 12 2015 17:18:18
%S 22718,366629,366629,5113258,12652497,5113258,71543684,365832647,
%T 365832647,71543684,996998308,10595045187,21178741484,10595045187,
%U 996998308,14068694499,306234039025,1227150387696,1227150387696
%N T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column not divisible by 11, read as a binary number with top and left being the most significant bits.
%C Table starts
%C .......22718........366629..........5113258..........71543684.........996998308
%C ......366629......12652497........365832647.......10595045187......306234039025
%C .....5113258.....365832647......21178741484.....1227150387696....71019451713332
%C ....71543684...10595045187....1227150387696...142245280010850.16472154924005889
%C ...996998308..306234039025...71019451713332.16472154924005889
%C .14068694499.8971344440493.4170821549442017
%H R. H. Hardin, <a href="/A263238/b263238.txt">Table of n, a(n) for n = 1..38</a>
%e Some solutions for n=1 k=4
%e ..1..1..1..0..0..0..0....1..1..1..0..1..0..0....1..1..1..0..0..0..1
%e ..0..0..0..0..0..1..1....0..0..1..0..0..1..0....0..0..1..0..1..0..0
%e ..0..0..1..0..1..0..1....0..0..0..1..0..0..1....0..0..1..1..1..1..1
%e ..0..0..0..1..0..0..1....0..0..0..0..0..1..0....0..0..1..1..0..1..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Oct 12 2015
| 