|
|
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.
|
|
1
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
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
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|