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.

A212924 Number of n X n 0..n-1 arrays with no column j greater than column j-1 in all rows.

Original entry on oeis.org

1, 15, 18226, 4041974015, 285912852294921876, 10046278068363977051128904352, 252848108054080530934326716965286554552380, 6218295117529777826597449794390561827118547543121719263231, 195564579665280381327483744593329391511083800439826359765867240005114671403240
Offset: 1

Views

Author

R. H. Hardin, May 31 2012

Keywords

Examples

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

Crossrefs

Diagonal of A212930.