The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #7 Jan 16 2024 10:27:57
%S 558,5136,46752,443362,4189216,39478862,371551030,3500351616,
%T 32968666098,310607972526,2925948121986,27562007609152,
%U 259623715582126,2445694348190100,23038546105524370,217021887885861286
%N 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.
%C Column 2 of A253164.
%H R. H. Hardin, <a href="/A253160/b253160.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=3
%e ..1..1..1....1..1..2....1..1..0....2..1..2....2..0..1....0..2..0....1..0..2
%e ..1..0..0....0..2..2....2..2..0....1..1..0....1..2..1....0..0..1....1..2..1
%e ..2..1..0....2..1..1....1..2..1....2..2..0....1..0..0....0..1..2....1..1..2
%e ..2..2..0....2..2..0....2..0..1....0..0..0....1..1..1....2..0..2....1..0..1
%Y Cf. A253164.
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 28 2014