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

 

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

%I

%S 117,1046,7595,46935,254725,1242042,5538026,22884715,88577443,

%T 323908967,1126962281,3752622108,12018652575,37179997956,111500267903,

%U 325181295220,924812060067,2571036007642,7001871008078,18714994291394,49177003589853

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

%C Row 2 of A233374.

%H R. H. Hardin, <a href="/A233376/b233376.txt">Table of n, a(n) for n = 1..67</a>

%e Some solutions for n=4

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 08 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 1 14:50 EDT 2023. Contains 361695 sequences. (Running on oeis4.)