|
|
A219417
|
|
Unchanging value maps: number of n X n binary arrays indicating the locations of corresponding elements unequal to no horizontal or antidiagonal neighbor in a random 0..2 n X n array
|
|
0
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3
..1..1..0....0..0..0....1..1..0....0..0..1....0..0..0....0..0..1....0..0..0
..0..0..0....0..1..0....0..0..0....1..1..1....1..0..1....0..0..1....1..0..1
..1..0..1....0..0..1....0..1..1....1..0..0....1..1..1....1..0..0....0..0..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|