|
%I #4 Jan 10 2014 07:38:11
%S 81,432,432,2304,5022,2304,9504,60879,60231,9504,39204,543946,1607343,
%T 533868,39204,138402,4895505,33361964,33411901,4740889,138402,488601,
%U 35230388,681329430,1782209164,692896087,33788761,488601,1553877
%N T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with 2X2 subblock sum of squares lexicographically nondecreasing rowwise and nonincreasing columnwise
%C Table starts
%C .......81........432..........2304............9504............39204
%C ......432.......5022.........60879..........543946..........4895505
%C .....2304......60231.......1607343........33361964........681329430
%C .....9504.....533868......33411901......1782209164......93548701107
%C ....39204....4740889.....692896087.....94717997107...12393951158079
%C ...138402...33788761...11682620720...4225274664375.1468687449529994
%C ...488601..241566875..200551110843.190528055285203
%C ..1553877.1459008798.2871917717259
%C ..4941729.8848965583
%C .14587326
%H R. H. Hardin, <a href="/A235421/b235421.txt">Table of n, a(n) for n = 1..60</a>
%F Empirical for column 1 and row 1:
%F [same linear recurrence of order 26]
%e Some solutions for n=2 k=4
%e ..2..0..0..0..0....0..2..2..0..0....2..0..1..0..0....1..0..2..0..2
%e ..2..1..0..0..0....2..1..0..0..1....2..0..2..0..2....2..1..1..0..0
%e ..2..0..1..0..1....2..1..0..0..2....2..1..1..0..2....0..2..0..0..2
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Jan 10 2014
| 