The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A233117 T(n,k)=Number of (n+1)X(k+1) 0..2 arrays x(i,j) with row sums sum{x(i,j), j=1..k+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing 8

%I

%S 29,112,123,365,1182,464,1079,9514,11741,1636,2969,67130,252958,

%T 110078,5523,7697,427059,4736663,6419678,980034,18027,19161,2495541,

%U 79223727,326851781,155904223,8365600,57505,46225,13620058,1206772195,14834218690

%N T(n,k)=Number of (n+1)X(k+1) 0..2 arrays x(i,j) with row sums sum{x(i,j), j=1..k+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing

%C Table starts

%C .....29......112........365........1079........2969.........7697.......19161

%C ....123.....1182.......9514.......67130......427059......2495541....13620058

%C ....464....11741.....252958.....4736663....79223727...1206772195.16999415895

%C ...1636...110078....6419678...326851781.14834218690.610630273520

%C ...5523...980034..155904223.21857081167

%C ..18027..8365600.3638300272

%C ..57505.69167118

%C .180104

%H R. H. Hardin, <a href="/A233117/b233117.txt">Table of n, a(n) for n = 1..40</a>

%e Some solutions for n=2 k=4

%e ..0..1..1..0..0....2..0..2..0..0....1..2..0..0..0....2..0..0..0..2

%e ..0..1..1..0..0....0..0..1..1..2....0..0..0..2..1....1..2..1..1..0

%e ..0..0..1..2..2....0..1..1..2..2....0..1..2..1..2....1..1..2..2..2

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_, Dec 04 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 11 12:12 EDT 2022. Contains 356065 sequences. (Running on oeis4.)