|
|
A183828
|
|
Number of (n+1)X(n+1) 0..2 arrays with each element of every 2X2 subblock being the sum mod 3 of two others
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for 3X3
..2..2..1....2..1..2....0..2..1....2..0..2....1..1..2....2..2..2....1..0..2
..0..1..0....1..0..1....2..1..2....1..1..1....2..2..1....0..1..1....2..2..1
..1..2..2....1..2..2....0..2..0....0..2..0....1..0..2....2..2..2....0..1..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|