|
|
A252776
|
|
Number of (n+2)X(6+2) 0..3 arrays with every consecutive three elements in every row, column and nw-se diagonal having exactly two distinct values, and new values 0 upwards introduced in row major order
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=1
..0..1..0..0..1..1..0..0....0..0..1..0..1..0..0..1....0..1..0..0..1..0..1..0
..1..2..2..1..1..0..1..1....0..1..1..2..2..1..1..0....2..0..0..2..2..1..1..0
..1..1..0..1..0..1..0..0....1..1..0..0..2..0..0..1....2..0..2..0..2..0..0..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|