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!)
A203957 Number of (n+1)X(n+1) 0..2 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) such that rows of b(i,j) and columns of c(i,j) are lexicographically nondecreasing 0

%I #5 Mar 31 2012 12:37:00

%S 32,851,144184,157316750,1111763853732,50733485047025530,

%T 15590622229636053238362

%N Number of (n+1)X(n+1) 0..2 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) such that rows of b(i,j) and columns of c(i,j) are lexicographically nondecreasing

%C Diagonal of A203965

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 08 2012

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 August 27 19:37 EDT 2024. Contains 375471 sequences. (Running on oeis4.)