The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #4 Oct 11 2015 20:52:25
%S 22718,366629,366629,5486039,12652497,5486039,76647286,398648507,
%T 398648507,76647286,1068732662,11542428929,26007537155,11542428929,
%U 1068732662,14937290926,333834894509,1532722380695,1532722380695
%N T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column not divisible by 13, read as a binary number with top and left being the most significant bits.
%C Table starts
%C ........22718........366629........5486039........76647286.....1068732662
%C .......366629......12652497......398648507.....11542428929...333834894509
%C ......5486039.....398648507....26007537155...1532722380695.90272986428673
%C .....76647286...11542428929..1532722380695.180709892658771
%C ...1068732662..333834894509.90272986428673
%C ..14937290926.9669206035811
%C .209908668003
%H R. H. Hardin, <a href="/A263198/b263198.txt">Table of n, a(n) for n = 1..31</a>
%e Some solutions for n=1 k=4
%e ..0..1..0..1..1..1..1....0..1..1..0..0..1..0....0..1..1..0..0..0..0
%e ..0..0..0..1..0..0..0....0..0..0..1..1..1..1....0..0..1..0..1..1..1
%e ..0..0..1..0..0..1..1....0..0..1..1..0..1..1....0..0..1..1..0..0..1
%e ..1..0..1..0..0..0..0....1..0..1..0..0..0..1....1..0..0..0..0..1..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Oct 11 2015