|
%I #4 Jan 10 2014 07:12:13
%S 256,2400,2400,22500,64848,22500,162000,1826923,1826923,162000,
%T 1166400,37684700,149643266,37684700,1166400,7157160,782294899,
%U 9676094946,9676094946,782294899,7157160,43917129,12863400296,623604857055
%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with 2X2 subblock sums lexicographically nondecreasing rowwise and nonincreasing columnwise
%C Table starts
%C ........256..........2400............22500............162000............1166400
%C .......2400.........64848..........1826923..........37684700..........782294899
%C ......22500.......1826923........149643266........9676094946.......623604857055
%C .....162000......37684700.......9676094946.....2164987528892....482514486123747
%C ....1166400.....782294899.....623604857055...482514486123747.362765302632826610
%C ....7157160...12863400296...32662713888028.90234375246775523
%C ...43917129..211918008383.1724073736174640
%C ..242230104.2916338598826
%C .1336048704
%H R. H. Hardin, <a href="/A235416/b235416.txt">Table of n, a(n) for n = 1..49</a>
%F Empirical for column k:
%F k=1: [linear recurrence of order 40]
%e Some solutions for n=2 k=4
%e ..0..0..0..0..1....2..0..0..0..2....2..0..0..0..1....2..0..2..0..0
%e ..3..0..2..0..0....2..0..3..0..1....1..0..2..0..0....2..0..0..0..1
%e ..3..3..0..2..1....3..2..3..1..1....2..2..2..0..1....2..3..0..2..3
%Y Column 1 is A204303
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Jan 10 2014
| 