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!)
A203962 Number of (n+1)X6 0..2 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 5352,276516,45390107,7594654075,1111763853732,136086136646160,

%T 14200017143149033,1287846430551372962,103368087058383084428,

%U 7449471107901921934366,487682253853367153932607

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

%H R. H. Hardin, <a href="/A203962/b203962.txt">Table of n, a(n) for n = 1..162</a>

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 08 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 July 4 16:24 EDT 2020. Contains 335448 sequences. (Running on oeis4.)