login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Number of (n+1)X(5+1) 0..3 arrays with the maximum minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one
1

%I #4 Feb 17 2014 11:43:39

%S 438768,14168952,363809888,10213967484,323819924384,9500262069216,

%T 300828077426994,9035028981379256,288763387135691996,

%U 8588440332702563980,272588711572505400802,8184709431799163625060,261311859323053903460964

%N Number of (n+1)X(5+1) 0..3 arrays with the maximum minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one

%C Column 5 of A238072

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

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 17 2014