cp's OEIS Frontend

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

%I A253161 #6 Jul 23 2025 13:55:00
%S A253161 3844,46752,555842,7252320,92998506,1190692584,15179218714,
%T A253161 194198939906,2482220834294,31740256495626,405683545431502,
%U A253161 5186473593590730,66301707444606534,847604837440730462,10835407210226372002
%N A253161 Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock sum differing from its neighbors horizontally, vertically and nw-se diagonally.
%C A253161 Column 3 of A253164
%H A253161 R. H. Hardin, <a href="/A253161/b253161.txt">Table of n, a(n) for n = 1..210</a>
%e A253161 Some solutions for n=2
%e A253161 ..0..1..0..1....1..2..1..2....1..1..1..2....1..1..1..0....2..1..2..2
%e A253161 ..2..0..0..1....2..0..1..2....0..0..1..2....2..0..0..2....0..1..1..2
%e A253161 ..2..1..1..1....2..0..0..0....2..1..2..0....2..1..2..1....0..1..0..1
%K A253161 nonn
%O A253161 1,1
%A A253161 _R. H. Hardin_, Dec 28 2014