|
%I #4 Oct 08 2015 15:02:03
%S 2,2,2,10,33,10,10,142,142,10,42,895,1666,895,42,42,4314,18390,18390,
%T 4314,42,170,22921,188370,498597,188370,22921,170,170,113486,1941702,
%U 10416690,10416690,1941702,113486,170,682,577071,19499266,232738767
%N T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each row and column not divisible by 3, read as a binary number with top and left being the most significant bits.
%C Table starts
%C ...2........2..........10.............10................42...................42
%C ...2.......33.........142............895..............4314................22921
%C ..10......142........1666..........18390............188370..............1941702
%C ..10......895.......18390.........498597..........10416690............232738767
%C ..42.....4314......188370.......10416690.........439260642..........19763462754
%C ..42....22921.....1941702......232738767.......19763462754........1825928130193
%C .170...113486....19499266.....4880746710......830550961170......155157177242886
%C .170...577071...196698070...104100946101....35491321238130....13464303796343791
%C .682..2877562..1968558130..2185333961490..1490799705490242..1144373527121975682
%C .682.14455993.19732383462.46071984907935.62885673930539394.97776065732064546321
%H R. H. Hardin, <a href="/A263060/b263060.txt">Table of n, a(n) for n = 1..264</a>
%F Empirical for column k:
%F k=1: a(n) = a(n-1) +4*a(n-2) -4*a(n-3)
%F k=2: a(n) = 5*a(n-1) +12*a(n-2) -60*a(n-3) -39*a(n-4) +195*a(n-5) +28*a(n-6) -140*a(n-7)
%F k=3: [order 8]
%F k=4: [order 11]
%F k=5: [order 11]
%F k=6: [order 17]
%F k=7: [order 21]
%e Some solutions for n=3 k=4
%e ..1..1..0..0..1....1..0..0..0..0....1..1..1..1..1....0..1..1..0..1
%e ..0..1..0..1..0....1..0..1..0..0....0..1..0..0..0....1..0..1..1..0
%e ..0..1..0..1..1....1..1..0..1..0....1..0..1..1..0....0..1..1..0..1
%e ..0..0..1..1..1....0..0..0..0..1....1..1..1..0..0....0..1..0..0..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Oct 08 2015
| 