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!)
A267991 Number of 2Xn arrays containing n copies of 0..2-1 with row sums and column sums nondecreasing. 1

%I #6 Aug 12 2016 06:54:16

%S 1,4,5,15,21,57,85,220,341,858,1365,3368,5461,13276,21845,52479,87381,

%T 207861,349525,824527,1398101,3274395,5592405,13015081,22369621,

%U 51769813,89478485,206045841,357913941,820475513,1431655765,3268499356,5726623061

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

%C Row 2 of A267990.

%H R. H. Hardin, <a href="/A267991/b267991.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=8

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

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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 13:30 EDT 2024. Contains 371957 sequences. (Running on oeis4.)