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!)
A203910 Number of (n+1)X3 0..6 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 1

%I #5 Mar 31 2012 12:36:58

%S 13006,1464079,147040347,11575205434,746879546466,40994270815269,

%T 1965119386833492,83865348311521049,3233306216832170143,

%U 113913902074758737877,3701779389021751147543,111810206223328416940268

%N Number of (n+1)X3 0..6 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 2 of A203913

%H R. H. Hardin, <a href="/A203910/b203910.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 07 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 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)