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