login

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

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

%I #4 Feb 11 2014 09:44:38

%S 256,1564,1564,9647,14244,9647,63000,132572,132572,63000,412120,

%T 1346420,1915153,1346420,412120,2668500,13569422,30618976,30618976,

%U 13569422,2668500,17280632,134401476,482106388,796647426,482106388,134401476

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

%C Table starts

%C ........256.........1564..........9647..........63000.........412120

%C .......1564........14244........132572........1346420.......13569422

%C .......9647.......132572.......1915153.......30618976......482106388

%C ......63000......1346420......30618976......796647426....20221334140

%C .....412120.....13569422.....482106388....20221334140...818214906406

%C ....2668500....134401476....7419017752...498113608930.31933527869372

%C ...17280632...1333046350..114668103482.12343384024320

%C ..112196812..13340078386.1793614472940

%C ..729345568.133387449994

%C .4730716616

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

%F Empirical for column k:

%F k=1: [linear recurrence of order 44] for n>45

%e Some solutions for n=2 k=4

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

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

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

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_, Feb 11 2014