A238298 - OEIS

%I #6 Dec 26 2023 16:54:32

%S 256,1836,1836,13405,23854,13405,99036,315906,315906,99036,730412,

%T 4268354,7627878,4268354,730412,5365422,57285970,189073818,189073818,

%U 57285970,5365422,39447709,765288116,4621997125,8714280010,4621997125

%N T(n,k) = Number of (n+1) X (k+1) 0..3 arrays with the maximum plus the upper median minus the lower median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.

%C Table starts

%C .........256..........1836..........13405...........99036...........730412

%C ........1836.........23854.........315906.........4268354.........57285970

%C .......13405........315906........7627878.......189073818.......4621997125

%C .......99036.......4268354......189073818......8714280010.....392415712138

%C ......730412......57285970.....4621997125....392415712138...32281789838154

%C .....5365422.....765288116...112528419472..17607428730016.2648594773768716

%C ....39447709...10243514512..2750034208462.793898547448114

%C ...290457856..137637981750.67554373314860

%C ..2138629508.1846283781696

%C .15729683540

%H R. H. Hardin, <a href="/A238298/b238298.txt">Table of n, a(n) for n = 1..60</a>

%F Empirical for column k:

%F k=1: [linear recurrence of order 32] for n>33.

%e Some solutions for n=2, k=4

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

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

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

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_, Feb 23 2014