cp's OEIS Frontend

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

%I A253163 #6 Jul 23 2025 13:55:14
%S A253163 186624,4189216,92998506,2461955138,62954425188,1612778665632,
%T A253163 40892835737758,1045243631714532,26655995880836874,680590803725411114,
%U A253163 17356137926136738110,442903594404834251862,11300064205772118129666
%N A253163 Number of (n+1)X(5+1) 0..2 arrays with every 2X2 subblock sum differing from its neighbors horizontally, vertically and nw-se diagonally.
%C A253163 Column 5 of A253164
%H A253163 R. H. Hardin, <a href="/A253163/b253163.txt">Table of n, a(n) for n = 1..35</a>
%e A253163 Some solutions for n=1
%e A253163 ..0..1..1..0..0..0....1..0..1..2..2..0....1..1..2..0..2..1....0..0..1..0..2..0
%e A253163 ..0..0..2..0..2..2....1..1..2..2..0..1....2..0..0..0..1..0....2..2..2..0..0..2
%K A253163 nonn
%O A253163 1,1
%A A253163 _R. H. Hardin_, Dec 28 2014