cp's OEIS Frontend

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

%I A253162 #6 Jul 23 2025 13:55:06
%S A253162 26784,443362,7252320,135741428,2461955138,44789509812,808045500430,
%T A253162 14674315377606,265844130932752,4822273171428216,87389675007459160,
%U A253162 1584487801002237370,28722425603939593796,520728445103764345118
%N A253162 Number of (n+1)X(4+1) 0..2 arrays with every 2X2 subblock sum differing from its neighbors horizontally, vertically and nw-se diagonally.
%C A253162 Column 4 of A253164
%H A253162 R. H. Hardin, <a href="/A253162/b253162.txt">Table of n, a(n) for n = 1..210</a>
%e A253162 Some solutions for n=1
%e A253162 ..1..1..2..0..1....1..1..0..1..0....2..0..0..1..2....2..1..2..1..2
%e A253162 ..2..2..2..1..2....1..0..0..1..2....0..0..1..2..1....2..2..0..1..1
%K A253162 nonn
%O A253162 1,1
%A A253162 _R. H. Hardin_, Dec 28 2014