[go: up one dir, main page]

login
T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column not divisible by 9, read as a binary number with top and left being the most significant bits.
4

%I #4 Oct 11 2015 08:37:38

%S 23966,323572,323572,4345200,8931088,4345200,63755349,245494656,

%T 245494656,63755349,913603171,7221845601,13895461376,7221845601,

%U 913603171,12918908831,207234582577,818220821498,818220821498

%N T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row and column not divisible by 9, read as a binary number with top and left being the most significant bits.

%C Table starts

%C .......23966........323572..........4345200..........63755349.........913603171

%C ......323572.......8931088........245494656........7221845601......207234582577

%C .....4345200.....245494656......13895461376......818220821498....46999429421814

%C ....63755349....7221845601.....818220821498....98334423583653.11457980858406059

%C ...913603171..207234582577...46999429421814.11457980858406059

%C .12918908831.5870470309217.2667613654543478

%H R. H. Hardin, <a href="/A263156/b263156.txt">Table of n, a(n) for n = 1..39</a>

%e Some solutions for n=1 k=4

%e ..0..1..0..1..0..0..0....0..0..0..1..1..0..1....0..1..1..1..1..0..0

%e ..0..0..0..0..0..0..1....0..0..1..0..1..0..0....0..0..1..0..1..1..1

%e ..0..0..1..0..0..1..1....0..0..0..0..0..1..0....0..0..1..0..0..0..0

%e ..1..0..0..0..1..1..1....1..1..0..0..0..0..0....1..0..0..0..0..0..0

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_, Oct 11 2015