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.

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

Original entry on oeis.org

1, 63, 18226, 14177855, 23124921876, 68264066143602, 330676305397366860, 2450628904209116751423, 26359630332235218287361280, 394964706663355785627860751188, 7977079877065700492793254299414812
Offset: 1

Views

Author

R. H. Hardin, May 31 2012

Keywords

Comments

Row 3 of A212930.

Examples

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

Crossrefs

Cf. A212930.