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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A203784 Number of (n+1)X6 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 1

%I

%S 93578,38244007,42858325343,43960759831841,36832573887843946,

%T 25396150957664543872,14840534395425885503779,

%U 7528124494277716464494686,3376948985825556038420624280,1358796512884129477227381718658

%N Number of (n+1)X6 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 5 of A203787

%H R. H. Hardin, <a href="/A203784/b203784.txt">Table of n, a(n) for n = 1..26</a>

%e Some solutions for n=4

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

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

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

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

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

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 30 12:22 EDT 2020. Contains 338079 sequences. (Running on oeis4.)