|
%I #4 Oct 03 2015 16:11:21
%S 6,6,13,12,34,27,318,196,132,54,900,3181,1336,396,109,4536,31050,
%T 37635,5184,1264,219,34782,352880,771084,420654,31512,3962,438,178926,
%U 4679725,17912392,14762016,3896365,175820,11886,877,1042284,58693450,481968171
%N T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each row divisible by 7 and column not divisible by 7, read as a binary number with top and left being the most significant bits.
%C Table starts
%C ....6......6.......12........318..........900..........4536.........34782
%C ...13.....34......196.......3181........31050........352880.......4679725
%C ...27....132.....1336......37635.......771084......17912392.....481968171
%C ...54....396.....5184.....420654.....14762016.....661066920...35819485902
%C ..109...1264....31512....3896365....290338650...26232879096.2864161217701
%C ..219...3962...175820...39348387...5692555116.1007501698644
%C ..438..11886...793812..417279054.108936025308
%C ..877..35914..4140908.3999504445
%C .1755.108556.21744992
%C .3510.325668
%H R. H. Hardin, <a href="/A262849/b262849.txt">Table of n, a(n) for n = 1..70</a>
%F Empirical for column k:
%F k=1: a(n) = 2*a(n-1) +a(n-3) -2*a(n-4)
%F k=2: [order 15]
%F k=3: [order 43]
%F k=4: [order 29]
%F Empirical for row n:
%F n=1: [linear recurrence of order 16]
%e Some solutions for n=3 k=4
%e ..0..1..1..1..0..0....0..0..0..1..1..1....0..0..1..1..1..0....0..0..0..0..0..0
%e ..0..0..0..1..1..1....1..1..1..0..0..0....0..1..1..1..0..0....1..1..1..1..1..1
%e ..0..0..1..1..1..0....0..1..0..1..0..1....1..1..0..0..0..1....1..0..0..0..1..1
%e ..0..0..1..1..1..0....0..1..0..1..0..1....0..1..1..1..0..0....1..0..0..0..1..1
%e ..1..1..1..1..1..1....0..1..0..1..0..1....1..1..1..0..0..0....1..0..0..0..1..1
%Y Column 1 is A033129(n+2).
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Oct 03 2015
| 