The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A203712 Number of (n+1)X4 0..5 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 64568,23213355,9336835297,2904393889106,721542795363654,

%T 149182735653334500,26470648450568790566,4120644647875346288314,

%U 572090230307626986813505,71746062664768072379446244

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

%H R. H. Hardin, <a href="/A203712/b203712.txt">Table of n, a(n) for n = 1..131</a>

%e Some solutions for n=4

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

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

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

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

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

%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.

Last modified August 12 04:52 EDT 2022. Contains 356067 sequences. (Running on oeis4.)