login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A267988 Number of nX2 arrays containing 2 copies of 0..n-1 with row sums and column sums nondecreasing. 0

%I

%S 1,4,21,189,1941,28032,448157,8951313,194183520,4923018003,

%T 134463192215

%N Number of nX2 arrays containing 2 copies of 0..n-1 with row sums and column sums nondecreasing.

%C Column 2 of A267990.

%e Some solutions for n=6

%e ..0..1....0..4....3..0....0..3....0..0....1..1....0..1....1..3....1..3....0..3

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

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

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

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

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

%Y Cf. A267990.

%K nonn

%O 1,2

%A _R. H. Hardin_, Jan 23 2016

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 November 12 09:25 EST 2019. Contains 329054 sequences. (Running on oeis4.)