

A253291


Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock sum differing from its neighbors horizontally, vertically, diagonally and antidiagonally


1



3844, 23546, 140536, 1029888, 7431136, 52784020, 376392916, 2705942488, 19441124904, 139538118106, 1001630063642, 7192898044676, 51663362450690, 371000801080586, 2664302414067690, 19133126021242278, 137412998986250836
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS



LINKS



EXAMPLE

Some solutions for n=3
..0..1..0..0....1..2..2..2....1..0..1..0....0..0..0..0....1..0..1..2
..0..0..1..2....0..0..0..1....2..0..0..2....1..2..0..0....2..0..1..2
..2..1..2..1....0..0..1..0....2..0..0..2....2..2..1..0....2..0..0..2
..1..2..0..0....1..2..1..1....2..1..2..2....2..2..1..1....0..0..0..1


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



