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!)
A203785 Number of (n+1)X7 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 0
452825, 439011778, 1799006388496, 7419043577516162, 25396150957664543872, 71462394089059338306691 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 6 of A203787

LINKS

Table of n, a(n) for n=1..6.

EXAMPLE

Some solutions for n=4

..1..0..2..1..1..3..1....2..3..2..2..2..2..2....0..0..2..3..2..3..3

..2..3..2..3..3..1..3....3..2..3..3..3..3..3....1..1..0..0..3..2..2

..3..3..0..0..0..2..3....2..3..3..3..3..3..3....2..2..1..2..0..3..3

..3..3..2..2..2..2..1....2..3..3..3..3..3..3....1..3..1..1..3..0..1

..3..3..2..2..2..3..1....2..3..3..3..3..3..3....3..1..3..1..0..2..2

CROSSREFS

Sequence in context: A227702 A210332 A209714 * A134960 A134888 A237867

Adjacent sequences:  A203782 A203783 A203784 * A203786 A203787 A203788

KEYWORD

nonn

AUTHOR

R. H. Hardin Jan 05 2012

STATUS

approved

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 28 09:43 EDT 2020. Contains 338052 sequences. (Running on oeis4.)