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.

A265000 Number of nX3 arrays containing 3 copies of 0..n-1 with rows and columns nondecreasing.

Original entry on oeis.org

1, 2, 7, 29, 140, 758, 4448, 27782, 182322, 1245399, 8793649, 63844600, 474662243, 3601895485, 27823860424, 218325937188, 1737070192604
Offset: 1

Views

Author

R. H. Hardin, Nov 29 2015

Keywords

Comments

Column 3 of A265005.

Examples

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

Crossrefs

Cf. A265005.