A263052 Number of (n+1)X(n+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, 33, 1666, 498597, 439260642, 1825928130193, 26380510465997186, 1607516667474074649381, 373842629115554331580791202, 353418497958270475251697468005873
Offset: 1
Keywords
Examples
Some solutions for n=3 ..1..0..1..1....1..0..0..0....0..1..0..1....1..0..1..1....1..0..1..1 ..0..1..0..0....0..1..1..1....0..0..1..0....0..0..0..1....0..1..0..1 ..1..0..1..1....1..0..1..0....0..1..0..1....1..0..1..1....0..1..1..1 ..0..0..1..0....1..0..1..1....1..1..1..0....1..1..1..0....0..1..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..11
Crossrefs
Cf. A263060.
Comments