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!)
A203786 Number of (n+1)X8 0..3 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:58

%S 2103364,4495376717,65121080193243,1066959581935799954,

%T 14840534395425885503779

%N Number of (n+1)X8 0..3 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 7 of A203787

%e Some solutions for n=4

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

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

%e ..1..2..2..2..1..1..2..2....2..3..3..3..3..3..3..3....2..2..3..1..3..3..2..3

%e ..3..3..1..1..2..3..3..1....2..3..3..3..3..3..3..3....3..2..1..3..2..2..3..1

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 05 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 24 06:14 EDT 2024. Contains 371918 sequences. (Running on oeis4.)