|
%I #9 Oct 30 2014 05:03:25
%S 34,94,94,265,356,265,739,1369,1369,739,2059,5167,7209,5167,2059,5746,
%T 19569,37029,37029,19569,5746,16033,74358,190951,259651,190951,74358,
%U 16033,44728,281925,989393,1823347,1823347,989393,281925,44728,124786
%N T(n,k) = Number of (n+2) X (k+2) binary arrays with no more than one of any consecutive three bits set in any row or column.
%C Table starts:
%C .....34.......94.......265.........739..........2059...........5746
%C .....94......356......1369........5167.........19569..........74358
%C ....265.....1369......7209.......37029........190951.........989393
%C ....739.....5167.....37029......259651.......1823347.......12853815
%C ...2059....19569....190951.....1823347......17439289......167404087
%C ...5746....74358....989393....12853815.....167404087.....2189182446
%C ..16033...281925...5113271....90488829....1604558949....28571620269
%C ..44728..1068716..26412799...636713695...15374009433...372754291904
%C .124786..4054318.136555683..4482191171..147377939501..4866369236348
%C .348145.15377537.705913811.31552566393.1412697193745.63523989811355
%H R. H. Hardin, <a href="/A202421/b202421.txt">Table of n, a(n) for n = 1..364</a>
%e Some solutions for n=4, k=3:
%e ..1..0..0..0..0....0..1..0..0..0....1..0..0..0..0....0..0..0..0..1
%e ..0..1..0..0..1....0..0..0..0..0....0..0..0..0..0....0..0..0..1..0
%e ..0..0..0..1..0....1..0..0..1..0....0..0..1..0..0....0..0..0..0..0
%e ..0..0..0..0..0....0..0..0..0..0....0..0..0..0..0....0..1..0..0..1
%e ..0..1..0..0..0....0..1..0..0..0....0..0..0..0..0....0..0..1..0..0
%e ..1..0..0..1..0....0..0..0..0..0....0..1..0..0..0....0..0..0..0..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Dec 19 2011
| 