|
%I #6 May 17 2023 11:20:11
%S 256,2982,2982,33640,108648,33640,343500,3945383,3945383,343500,
%T 3415268,123132965,490074558,123132965,3415268,32611962,3714091695,
%U 51929974331,51929974331,3714091695,32611962,306033109,103423011021,5302813444717
%N T(n,k) = Number of (n+1) X (k+1) 0..3 arrays with the sum of each 2 X 2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.
%C Table starts
%C ......256.........2982...........33640..............343500..............3415268
%C .....2982.......108648.........3945383...........123132965...........3714091695
%C ....33640......3945383.......490074558.........51929974331........5302813444717
%C ...343500....123132965.....51929974331......19569523022916.....7279199801456820
%C ..3415268...3714091695...5302813444717....7279199801456820.10251146884479114976
%C .32611962.103423011021.486511569699939.2418013523229434607
%H R. H. Hardin, <a href="/A235506/b235506.txt">Table of n, a(n) for n = 1..49</a>
%F Empirical for column k:
%F k=1: [linear recurrence of order 22]
%e Some solutions for n=2, k=4
%e ..0..0..3..1..1....0..0..3..3..3....0..0..2..1..2....0..0..2..1..3
%e ..0..0..3..0..3....0..0..3..0..3....0..0..1..3..3....0..0..3..2..3
%e ..0..0..3..1..0....0..0..3..2..0....0..0..3..0..2....0..0..2..2..2
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Jan 11 2014
| 