The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 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
 32, 851, 144184, 157316750, 1111763853732, 50733485047025530, 15590622229636053238362 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Diagonal of A203965 LINKS EXAMPLE Some solutions for n=4 ..0..0..2..0..1....1..1..2..2..1....0..1..0..2..2....1..2..1..1..1 ..1..1..0..2..1....1..2..1..1..2....1..1..2..2..2....2..1..2..2..2 ..0..2..0..1..2....2..1..2..2..2....2..1..1..2..2....1..2..2..2..2 ..1..1..2..1..2....2..2..2..2..0....1..2..1..2..2....1..2..2..2..2 ..2..2..1..2..2....2..2..2..2..0....1..2..2..0..2....1..2..2..2..2 CROSSREFS Sequence in context: A139677 A231161 A220460 * A301839 A302067 A281474 Adjacent sequences:  A203954 A203955 A203956 * A203958 A203959 A203960 KEYWORD nonn AUTHOR R. H. Hardin Jan 08 2012 STATUS approved

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

Last modified August 4 07:32 EDT 2020. Contains 336201 sequences. (Running on oeis4.)