cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A212931 Number of 2Xn 0..n-1 arrays with no column j greater than column j-1 in all rows.

Original entry on oeis.org

1, 15, 568, 39695, 4431876, 724082352, 163050236504, 48442719007503, 18368207542264060, 8659014569831436140, 4968837728849467193040, 3410836618457710864892912, 2760233360074280192888992948
Offset: 1

Views

Author

R. H. Hardin May 31 2012

Keywords

Comments

Row 2 of A212930

Examples

			Some solutions for n=3
..0..1..2....0..0..1....2..1..0....0..0..0....2..1..2....0..2..1....0..2..0
..1..0..0....0..1..1....2..1..2....1..2..0....0..0..0....0..0..2....1..0..1