A263060 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.
2, 2, 2, 10, 33, 10, 10, 142, 142, 10, 42, 895, 1666, 895, 42, 42, 4314, 18390, 18390, 4314, 42, 170, 22921, 188370, 498597, 188370, 22921, 170, 170, 113486, 1941702, 10416690, 10416690, 1941702, 113486, 170, 682, 577071, 19499266, 232738767
Offset: 1
Examples
Some solutions for n=3 k=4 ..1..1..0..0..1....1..0..0..0..0....1..1..1..1..1....0..1..1..0..1 ..0..1..0..1..0....1..0..1..0..0....0..1..0..0..0....1..0..1..1..0 ..0..1..0..1..1....1..1..0..1..0....1..0..1..1..0....0..1..1..0..1 ..0..0..1..1..1....0..0..0..0..1....1..1..1..0..0....0..1..0..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..264
Formula
Empirical for column k:
k=1: a(n) = a(n-1) +4*a(n-2) -4*a(n-3)
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)
k=3: [order 8]
k=4: [order 11]
k=5: [order 11]
k=6: [order 17]
k=7: [order 21]
Comments