login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A266075
Number of n X n integer arrays with each element equal to the number of horizontal and vertical neighbors differing from itself by exactly one.
0
1, 1, 4, 5, 29, 78, 466, 3907, 52773, 925875, 25789942
OFFSET
1,3
COMMENTS
Diagonal of A266081.
EXAMPLE
All solutions for n=4
..0..2..3..2....0..0..0..0....0..0..0..0....2..3..2..0....0..0..0..0
..0..3..4..3....2..3..2..0....0..0..0..0....3..4..3..0....0..2..3..2
..0..2..3..2....3..4..3..0....0..0..0..0....2..3..2..0....0..3..4..3
..0..0..0..0....2..3..2..0....0..0..0..0....0..0..0..0....0..2..3..2
CROSSREFS
Cf. A266081.
Sequence in context: A092659 A002352 A042647 * A041273 A256623 A047169
KEYWORD
nonn
AUTHOR
R. H. Hardin, Dec 20 2015
STATUS
approved