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.

A233063 Number of (2+1) X (n+1) 0..1 arrays x(i,j) with row sums sum{x(i,j), j=1..n+1} nondecreasing, and column sums sum{i*x(i,j), i=1..2+1} nondecreasing.

Original entry on oeis.org

16, 47, 130, 319, 755, 1680, 3673, 7751, 16254, 33352, 68448, 138469, 281122, 564810, 1140621, 2284335, 4601127, 9201288, 18508319, 36987885, 74343834, 148524185, 298379462, 596003105, 1196923732, 2390589937, 4799574872, 9585538381
Offset: 1

Views

Author

R. H. Hardin, Dec 03 2013

Keywords

Comments

Row 2 of A233062.

Examples

			Some solutions for n=5
..0..0..1..0..0..1....0..0..1..1..0..1....0..0..1..0..0..0....0..0..1..0..1..1
..0..0..0..1..1..1....0..0..1..0..1..1....0..0..1..0..0..1....0..0..1..0..1..1
..1..1..1..1..1..1....0..1..0..1..1..1....0..1..0..1..1..1....1..1..0..1..0..1
		

Crossrefs

Cf. A233062.