cp's OEIS Frontend

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

%I A253292 #6 Jul 23 2025 13:55:48
%S A253292 26784,167832,1029888,8153960,61286116,465921688,3524494796,
%T A253292 26879615668,204459584768,1560668372324,11882769388376,90517446353584,
%U A253292 689680753666852,5257319067276484,40057456786744360,305206750112569024
%N A253292 Number of (n+1)X(4+1) 0..2 arrays with every 2X2 subblock sum differing from its neighbors horizontally, vertically, diagonally and antidiagonally.
%C A253292 Column 4 of A253294
%H A253292 R. H. Hardin, <a href="/A253292/b253292.txt">Table of n, a(n) for n = 1..210</a>
%e A253292 Some solutions for n=2
%e A253292 ..1..0..0..0..0....0..2..2..2..2....1..2..0..0..1....0..1..2..2..2
%e A253292 ..0..0..0..2..2....0..2..2..1..1....2..1..0..1..1....1..1..2..2..0
%e A253292 ..1..2..2..1..1....1..0..2..0..2....2..2..1..0..2....2..1..0..1..0
%K A253292 nonn
%O A253292 1,1
%A A253292 _R. H. Hardin_, Dec 29 2014