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!)
A203660 Number of (n+1)X5 0..7 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 #4 Mar 31 2012 12:36:57

%S 9592248,85151157995,931767180207600,7676075878291358313,

%T 49640621147968317363235

%N Number of (n+1)X5 0..7 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 Column 4 of A203661

%e Some solutions for n=5

%e ..4..4..6..2..2....4..3..1..5..6....5..4..4..4..2....0..2..2..1..6

%e ..4..5..3..7..7....2..5..7..3..4....4..5..5..5..7....2..4..4..6..3

%e ..7..5..7..4..4....7..1..0..6..6....2..7..7..7..5....5..5..5..5..5

%e ..5..7..5..6..6....6..2..3..0..5....5..5..5..5..7....3..7..7..7..2

%e ..7..5..7..5..6....1..7..3..6..3....4..6..6..6..4....6..7..7..0..1

%e ..5..7..5..7..7....1..7..3..6..3....6..5..5..5..7....6..7..7..0..4

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 04 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 April 18 06:24 EDT 2024. Contains 371769 sequences. (Running on oeis4.)