|
|
A266080
|
|
Number of nX7 integer arrays with each element equal to the number of horizontal and vertical neighbors differing from itself by exactly one.
|
|
1
|
|
|
1, 1, 10, 23, 55, 146, 466, 1155, 3364, 9229, 25566, 70308, 196647, 544696, 1527557, 4229863, 11872589, 32954820, 92269343, 256481433, 718070373, 1997666638, 5589444252, 15558565416, 43515994717, 121194482007, 338915914513
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..0..0..0..0..0..0....0..0..0..0..0..0..0....0..0..0..0..2..3..2
..2..3..2..2..3..2..0....0..0..2..3..2..0..0....0..0..0..0..3..4..3
..3..4..3..3..4..3..0....0..0..3..4..3..0..0....0..0..0..0..2..3..2
..2..3..2..2..3..2..0....0..0..2..3..2..0..0....0..0..0..0..0..0..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|