A253160 Number of (n+1) X (2+1) 0..2 arrays with every 2 X 2 subblock sum differing from its neighbors horizontally, vertically and nw-se diagonally.

558, 5136, 46752, 443362, 4189216, 39478862, 371551030, 3500351616, 32968666098, 310607972526, 2925948121986, 27562007609152, 259623715582126, 2445694348190100, 23038546105524370, 217021887885861286

Offset: 1

Author

R. H. Hardin, Dec 28 2014

Keywords

• nonn

Comments

Column 2 of A253164.

Examples

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

Links

• R. H. Hardin, Table of n, a(n) for n = 1..210

Crossrefs

Cf. A253164.