|
%I #4 Nov 26 2014 10:00:49
%S 81,484,484,2704,6166,2704,13456,71610,71610,13456,64009,712806,
%T 1690656,712806,64009,290521,6676967,32944614,32944614,6676967,290521,
%U 1283689,58739370,595652178,1223112064,595652178,58739370,1283689,5541316
%N T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing maximum of every two consecutive values in every row and column
%C Table starts
%C .......81.........484...........2704.............13456................64009
%C ......484........6166..........71610............712806..............6676967
%C .....2704.......71610........1690656..........32944614............595652178
%C ....13456......712806.......32944614........1223112064..........41645945389
%C ....64009.....6676967......595652178.......41645945389........2643367969909
%C ...290521....58739370.....9955305702.....1297010595743......152027338842125
%C ..1283689...498574034...159191945604....38406061258495.....8269611194424492
%C ..5541316..4101893438..2447786874761..1087877705486708...428355037265846415
%C .23541904.33038787862.36658965039940.29903210113757561.21466834599667321402
%H R. H. Hardin, <a href="/A250620/b250620.txt">Table of n, a(n) for n = 1..144</a>
%F Empirical for column k:
%F k=1: [linear recurrence of order 13]
%F k=2: [order 39]
%e Some solutions for n=2 k=4
%e ..0..0..0..0..1....0..0..0..2..0....0..0..0..1..2....0..0..0..1..0
%e ..0..2..2..0..2....1..0..2..2..1....0..1..1..0..2....1..1..2..2..2
%e ..2..2..2..2..1....1..2..0..2..2....0..1..2..2..2....0..1..0..2..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Nov 26 2014
| 