login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock ne-sw antidiagonal difference unequal to its neighbors horizontally and nw+se diagonal sum unequal to its neighbors vertically
1

%I #4 Jan 02 2015 10:21:22

%S 3888,85464,1962374,44943722,1029772234,23584643086,540341231986,

%T 12377899231078,283563887073558,6496001687360296,148814367527678450,

%U 3409120312651672240,78098067867938650674,1789114238863991229228

%N Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock ne-sw antidiagonal difference unequal to its neighbors horizontally and nw+se diagonal sum unequal to its neighbors vertically

%C Column 3 of A253482

%H R. H. Hardin, <a href="/A253479/b253479.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=2

%e ..0..0..0..2....1..1..1..2....2..0..2..2....2..2..0..0....1..1..1..0

%e ..0..1..0..1....2..0..2..0....2..1..0..1....0..1..2..0....2..0..0..2

%e ..0..0..0..2....0..1..2..0....0..2..2..0....1..1..0..1....2..0..0..0

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 02 2015