|
%I #4 Jan 10 2014 08:07:29
%S 256,3038,3038,33610,112442,33610,344668,3874844,3874844,344668,
%T 3402366,119751976,439379938,119751976,3402366,32542312,3475660106,
%U 44578500538,44578500538,3475660106,32542312,304784986,95292647278,4199042223300
%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise
%C Table starts
%C ........256..........3038...........33610...........344668..........3402366
%C .......3038........112442.........3874844........119751976.......3475660106
%C ......33610.......3874844.......439379938......44578500538....4199042223300
%C .....344668.....119751976.....44578500538...15581843596522.5142104597554476
%C ....3402366....3475660106...4199042223300.5142104597554476
%C ...32542312...95292647278.363811777078888
%C ..304784986.2512120106496
%C .2807381170
%H R. H. Hardin, <a href="/A235430/b235430.txt">Table of n, a(n) for n = 1..40</a>
%F Empirical for column k:
%F k=1: [linear recurrence of order 12]
%e Some solutions for n=2 k=4
%e ..0..0..1..3..3....0..0..1..0..0....0..0..1..2..0....0..0..1..1..3
%e ..0..0..3..0..3....0..0..0..2..2....0..0..0..0..2....0..0..0..0..3
%e ..0..0..3..0..3....0..0..2..3..0....0..1..1..3..1....0..0..2..1..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Jan 10 2014
| 