|
%I #4 Oct 03 2015 13:15:32
%S 0,0,0,2744,0,0,21610,21952,0,0,234096,323944,175616,0,0,3103450,
%T 6854952,4816416,1442897,0,0,43563108,178305048,199142208,77077352,
%U 11697083,0,0,617554352,4999029536,10266462240,6302057614,1189915948,94196375,0,0
%N T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row divisible by 9 and column not divisible by 9, read as a binary number with top and left being the most significant bits.
%C Table starts
%C .0.0......2744.......21610.......234096......3103450.....43563108
%C .0.0.....21952......323944......6854952....178305048...4999029536
%C .0.0....175616.....4816416....199142208..10266462240.573389614080
%C .0.0...1442897....77077352...6302057614.635153297526
%C .0.0..11697083..1189915948.190675572814
%C .0.0..94196375.18025774598
%C .0.0.753571000
%C .0.0
%C .0
%H R. H. Hardin, <a href="/A262819/b262819.txt">Table of n, a(n) for n = 1..48</a>
%F Empirical for column k:
%F k=3: [linear recurrence of order 17]
%e Some solutions for n=3 k=4
%e ..0..1..1..0..1..1..0....0..0..1..1..0..1..1....0..0..0..0..0..0..0
%e ..1..1..1..1..1..1..0....0..1..0..0..1..0..0....0..1..1..1..1..1..1
%e ..1..0..1..0..0..0..1....1..0..1..1..0..1..0....0..0..1..0..0..1..0
%e ..0..0..0..1..0..0..1....0..0..0..0..0..0..0....0..0..1..0..0..1..0
%e ..0..0..1..1..0..1..1....1..0..1..0..0..0..1....1..0..0..1..0..0..0
%e ..0..0..0..1..0..0..1....1..0..1..1..0..1..0....1..0..1..1..0..1..0
%K nonn,tabl
%O 1,4
%A _R. H. Hardin_, Oct 03 2015
| 