|
%I #4 Oct 09 2015 21:55:47
%S 102,690,690,4614,12295,4614,28626,186793,186793,28626,173010,2451774,
%T 6131873,2451774,173010,1049016,32967539,165679122,165679122,32967539,
%U 1049016,6331494,436704585,4679372053,8973167514,4679372053,436704585
%N T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each row and column not divisible by 7, read as a binary number with top and left being the most significant bits.
%C Table starts
%C ........102..........690...........4614............28626...........173010
%C ........690........12295.........186793..........2451774.........32967539
%C .......4614.......186793........6131873........165679122.......4679372053
%C ......28626......2451774......165679122.......8973167514.....510985828470
%C .....173010.....32967539.....4679372053.....510985828470...59375688090683
%C ....1049016....436704585...129402530117...28342984553670.6681095224794601
%C ....6331494...5681806458..3494107918878.1530508039933938
%C ...37989042..74169569127.94864200490265
%C ..228197310.966450565505
%C .1370694210
%H R. H. Hardin, <a href="/A263117/b263117.txt">Table of n, a(n) for n = 1..59</a>
%F Empirical for column k:
%F k=1: [linear recurrence of order 16]
%e Some solutions for n=2 k=4
%e ..0..0..1..0..0..1....0..0..1..0..0..0....0..1..0..1..0..0....0..1..1..1..1..1
%e ..0..1..0..0..1..0....0..1..1..0..0..1....0..0..1..0..0..0....0..1..0..0..0..0
%e ..0..0..1..0..0..0....0..1..0..0..1..0....0..0..1..0..1..1....0..0..0..1..0..1
%e ..1..0..1..1..0..1....1..0..0..1..0..1....1..1..0..1..0..1....1..0..1..0..0..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Oct 09 2015
| 