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.

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

Original entry on oeis.org

1, 1023, 14230810, 1075113010175, 285912852294921876, 207406617181155352354002, 346763870885473008105706659876, 1185276120077816152516945331537683455
Offset: 1

Views

Author

R. H. Hardin May 31 2012

Keywords

Comments

Row 5 of A212930.

Examples

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

Crossrefs

Cf. A212930.